Computer

Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 30923 Accepted Submission(s): 3861

Problem Description

A school bought the first computer some time ago(so this computer's id is 1). During the recent years the school bought N-1 new computers. Each new computer was connected to one of settled earlier. Managers of school are anxious about slow functioning of the net and want to know the maximum distance Si for which i-th computer needs to send signal (i.e. length of cable to the most distant computer). You need to provide this information.

Hint: the example input is corresponding to this graph. And from the graph, you can see that the computer 4 is farthest one from 1, so S1 = 3. Computer 4 and 5 are the farthest ones from 2, so S2 = 2. Computer 5 is the farthest one from 3, so S3 = 3. we also get S4 = 4, S5 = 4.

Input

Input file contains multiple test cases.In each case there is natural number N (N<=10000) in the first line, followed by (N-1) lines with descriptions of computers. i-th line contains two natural numbers - number of computer, to which i-th computer is connected and length of cable used for connection. Total length of cable does not exceed 10^9. Numbers in lines of input are separated by a space.

Output

For each case output N lines. i-th line must contain number Si for i-th computer (1<=i<=N).

Sample Input

5
1 1
2 1
3 1
1 1

Sample Output

3
2
3
4
4

Author

scnu

题意：问从每个几点出发所到达的最远距离。

思路：两遍dfs，一遍从上往下，一遍从下往上，答案为往上走或往下走的最大值。

 //2017-09-13

 #include <cstdio>

 #include <cstring>

 #include <iostream>

 #include <algorithm>

 using namespace std;

 const int N = ;

 int head[N], tot;

 struct Edge{

     int v, w, next;

 }edge[N<<];

 void init(){

     tot = ;

     memset(head, -, sizeof(head));

 }

 void add_edge(int u, int v, int w){

     edge[tot].v = v;

     edge[tot].w = w;

     edge[tot].next = head[u];

     head[u] = tot++;

 }

 //down[u][0]表示u节点往下走的最大距离，down[u][1]表示节点u往下走的次大距离

 //up[u]表示节点u往上走的最大距离，son[u]表示u节点往下走的最大距离对应的儿子

 int n, down[N][], up[N], son[N];

 void dfs1(int u, int fa){

     for(int i = head[u]; i != -; i = edge[i].next){

         int v = edge[i].v, w = edge[i].w;

         if(v == fa)continue;

         dfs1(v, u);

         if(down[v][]+w > down[u][]){//更新最大的情况

             down[u][] = down[u][];

             down[u][] = down[v][]+w;

             son[u] = v;

         }else if(down[v][]+w > down[u][])//只更新次大值的情况

               down[u][] = down[v][] + w;

     }

 }

 void dfs2(int u, int fa){

     for(int i = head[u]; i != -; i = edge[i].next){

         int v = edge[i].v, w = edge[i].w;

         if(v == fa)continue;

         if(son[u] != v)

             up[v] = max(up[u]+w, down[u][]+w);

         else

             up[v] = max(up[u]+w, down[u][]+w);

         dfs2(v, u);

     }

 }

 int main()

 {

     //freopen("inputD.txt", "r", stdin);

     while(scanf("%d", &n) != EOF){

         init();

         int v, w;

         for(int i = ; i <= n; i++){

             scanf("%d%d", &v, &w);

             add_edge(i, v, w);

             add_edge(v, i, w);

         }

         memset(up, , sizeof(up));

         memset(down, , sizeof(down));

         dfs1(, );

         dfs2(, );

         for(int i = ; i <= n; i++)

               printf("%d\n", max(up[i], down[i][]));

     }

     return ;

 }

巴特西

HDU2196(SummerTrainingDay13-D tree dp)