hdu2196 Computer【树形DP】【换根法】

Computer

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

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

 

Recommend

lcy   |   We have carefully selected several similar problems for you:  1561 1011 3456 1520 2242 

题意：

一棵有n个节点的树，有权边。问每个节点到其他节点的最远距离分别是多少。

思路：

如果固定一个节点，那么dfs找最远的距离就可以了。用dp[i]表示以i为根的子树中，i可到的最远距离。

对于任意一个节点i，他到达的最远节点有可能在子树中，也有可能不在子树中。所以我们分别找到子树中的最远距离和不在子树中的最远距离。

dfs1就是用dp存储了在子树中的最远距离。

dfs2就是把当前节点换到了根的位置，用f存储不在子树中的最远距离。那么他到他子树节点的距离是变短了的就不用管了。

把i换成根，把i的父亲father换下去，如果i在i的父亲这棵子树的最长路径上。father换下去之后，就要考虑原本以father为根的子树的第二长路径。

如果i不在father的最长路径上，那就是在f和dp中找大的加上当前路径长度。

 //#include <bits/stdc++.h>
 #include<iostream>
 #include<cmath>
 #include<algorithm>
 #include<stdio.h>
 #include<cstring>
 #include<vector>
 #include<map>
 #include<set>

 #define inf 0x3f3f3f3f
 using namespace std;
 typedef long long LL;

 const int maxn = ;
 int head[maxn], dp[maxn], f[maxn], second[maxn], longest[maxn];
 struct node{
     int v;
     int nxt;
     int weight;
 }edge[maxn * ];
 int n, cnt;

 void addedge(int u, int v, int w)
 {
     edge[cnt].v = v;
     edge[cnt].weight = w;
     edge[cnt].nxt = head[u];
     head[u] = cnt++;
     edge[cnt].v = u;
     edge[cnt].weight = w;
     edge[cnt].nxt = head[v];
     head[v] = cnt++;
 }

 void dfs1(int rt, int fa)
 {
     for(int i = head[rt]; i != -; i = edge[i].nxt){
         int son = edge[i].v;
         if(son == fa)continue;
         dfs1(son, rt);
         //dp[rt] = max(dp[rt], dp[son] + edge[i].weight);
         if(dp[son] + edge[i].weight > dp[rt]){
             longest[rt] = son;
             second[rt] = max(second[rt], dp[rt]);
             dp[rt] = dp[son] + edge[i].weight;
         }
         else if(second[rt] < dp[son] + edge[i].weight){
             second[rt] = dp[son] + edge[i].weight;
         }
     }
 }

 void dfs2(int rt, int fa)
 {
     for(int i = head[rt]; i != -; i = edge[i].nxt){
         int son = edge[i].v;
         if(son == fa)continue;
         if(longest[rt] == son)f[son] = max(f[rt], second[rt]) + edge[i].weight;
         else f[son] = max(f[rt], dp[rt]) + edge[i].weight;
         dfs2(son, rt);
     }
 }

 int main(){
     while(scanf("%d", &n) != EOF){
         cnt = ;
         memset(head, -, sizeof(head));
         for(int i = ; i <= n; i++){
             int u, w;
             scanf("%d%d", &u, &w);
             addedge(u, i, w);
         }
         memset(dp, , sizeof(dp));
         memset(second, , sizeof(second));
         memset(longest, , sizeof(longest));
         memset(f, , sizeof(f));
         dfs1(, );

         dfs2(, );
         //f[1] = dp[1];
         for(int i = ; i <= n; i++){
             printf("%d\n", max(dp[i], f[i]));
         }
     }
     return ;
 }