解题思路:
注意事项:
参考代码:
n=int(input()) road=[[0]*(n+1) for _ in range(n+1)] for i in range(n-1): a,b,c=map(int,input().strip().split()) road[a][b]=c road[b][a]=c vis=[False for i in range(n+1)] distance=0 node=0 def DFS(fr,dis): global distance,node,vis if dis>distance: distance=dis node=fr for i in range(1,n+1): if vis[i]==False and road[fr][i]!=0: vis[i]=True DFS(i,dis+road[fr][i]) vis[i]=False vis[1]=True DFS(1,0) vis[1]=False distance=0 vis[node]=True DFS(node,0) num=0 for i in range(1,distance+1): num+=i+10 print(num)
0.0分
0 人评分