lightoj 1257 - Farthest Nodes in a Tree (II)（树的直径升级版）

Given a tree (a connected graph with no cycles), you have to find the cost to go to the farthest node from each node. The edges of the tree are weighted and undirected.

Input

Input starts with an integer T (≤ 10), denoting the number of test cases.

Each case starts with an integer n (2 ≤ n ≤ 30000) denoting the total number of nodes in the tree. The nodes are numbered from 0 to n-1. Each of the next n-1 lines will contain three integers u v w (0 ≤ u, v < n, u ≠ v, 1 ≤ w ≤ 10000) denoting that node u and v are connected by an edge whose weight is w. You can assume that the input will form a valid tree.

Output

For each case, print the case number in a line first. Then for each node (from 0 to n - 1) print the cost to go to the farthest node in a separate line.

Sample Input	Output for Sample Input
2 4 0 1 20 1 2 30 2 3 50 5 0 2 20 2 1 10 0 3 29 0 4 50	Case 1: 100 80 50 100 Case 2: 50 80 70 79 80

这题是上一题的升级版，要求所有点到距离他最远点的距离，在一棵树上，任意一个点和它距离最远的点肯定在树直径的端点上，所以就是要求每一个点是到哪个端点的距离最大。和求树的直径一样，先找出其中一个端点，再从这个端点搜到另一个端点，随便把这个端点到其他点的距离求出来，然后再从另一个端点搜回来。

#include<vector>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>

using namespace std;

struct edge
{
    int to,cost;
};
vector<edge> e[60010];
int farthest,ans;
int dp[60010];
void dfs(int x,int pre,int dis)
{
    for(int i=0;i<e[x].size();i++)
    {
        int xx = e[x][i].to;
        if(xx == pre)
            continue;
        dp[xx] = max(dp[xx],dis+e[x][i].cost);
        dfs(xx,x,dis+e[x][i].cost);
    }
    if(dis > ans)
    {
        ans = dis;
        farthest = x;
    }
}
int main(void)
{
    int T,n,i,j;
    scanf("%d",&T);
    int cas = 1;
    while(T--)
    {
        scanf("%d",&n);
        for(i=0;i<=n;i++)
            e[i].clear();
        memset(dp,0,sizeof(dp));
        for(i=0;i<n-1;i++)
        {
            int x,y;
            edge t;
            scanf("%d%d%d",&x,&y,&t.cost);
            t.to = y;
            e[x].push_back(t);
            t.to = x;
            e[y].push_back(t);
        }
        ans = 0;
        dfs(0,-1,0);
        dfs(farthest,-1,0);
        dfs(farthest,-1,0);
        printf("Case %d:\n",cas++);
        for(i=0;i<n;i++)
            printf("%d\n",dp[i]);
    }

    return 0;
}