HDOJ --- 2196 Computer

Computer

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

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

 

思路：先选定1为树根，进行第一次深搜，很容易求出节点u到其子节点的最长距离和次长距离，求次长距离的目的是如果u的跟节点最长路径经过u则dp的时候就不能取其跟节点的最长距离，应该取其次长距离;然后进行第二次深搜，搜索节点u经过其跟节点的最长距离。

如果令dp[u][0],dp[u][1],分别为节点u到子节点的最长，次长距离，dp[u][2]表示节点u经过其跟节点v的最长距离，则状态方程为 dp[u][2] = max(dp[v][2],dp[u][0] + edge[j].w == dp[v][0] ? dp[v][1] : dp[v][0]) + edge[j].w;

最后输出答案为max(dp[u][0],dp[u][2]),即某点u的最长距离为其到子节点的最长距离和经过其跟节点的最长距离二者之中的最大者。

 

 #include<iostream>
 #include<cstdio>
 #include<cstring>
 #define MAX 11111
 using namespace std;
 typedef long long int LL;
 typedef struct{
     int to, next, w;
 }Node;
 Node edge[MAX];
 LL head[MAX], dp[MAX][];
 void AddEdge(int u, int v, int w, int i){
     edge[i].to = v;
     edge[i].w = w;
     edge[i].next = head[u];
     head[u] = i;
 }
 void dfs_to_son(int i){
     LL bigest = , biger = ;
     for(int j = head[i];j != -;j = edge[j].next){
         int v = edge[j].to;
         dfs_to_son(v);
         LL temp = dp[v][] + edge[j].w;
         if(bigest <= temp){
             biger = bigest;
             bigest = temp;
         }else if(temp > biger) biger = temp;
     }
     dp[i][] = bigest;
     dp[i][] = biger;
 }
 void dfs_to_father(int i){
     for(int j = head[i];j != -;j = edge[j].next){
         int v = edge[j].to;
         dp[v][] = max(dp[i][], dp[v][] + edge[j].w == dp[i][] ? dp[i][]:dp[i][]) + edge[j].w;
         dfs_to_father(v);
     }
 }
 int main(){
     int n, u, w;
     /* freopen("in.c", "r", stdin); */
     while(~scanf("%d", &n)){
         memset(dp, , sizeof(dp));
         memset(head, -, sizeof(head));
         for(int i = ;i <= n;i ++){
             scanf("%d%d", &u, &w);
             AddEdge(u, i, w, i-);
         }
         dfs_to_son();
         dfs_to_father();
         for(int i = ;i <= n;i ++) printf("%lld\n", max(dp[i][], dp[i][]));
     }
     return ;
 }