树的直径 hdu 2196

仅供自己复习。

另附网站 http://www.cnblogs.com/wuyiqi/archive/2012/04/08/2437424.html

网站2： http://blog.csdn.net/y990041769/article/details/38121945

#include <iostream>  
#include <cstdio>  
#include <algorithm>  
#include <cstring>   
#include <vector>  
using namespace std;  
const int N = 10100;  
struct Node  
{  
    int to;  
    int cap;
	Node(int a,int b)
	{
	  to = a, cap = b;	
	}  
};  
vector<Node> v[N];  
int dp[N][4];   
int n;  
void dfs1(int z,int fa)
{
  	int dd = v[z].size();
  	int max1=0,max2=0;
  	for(int i=0; i<dd; i++)
  	{
  	  	Node tmp = v[z][i];
		if(tmp.to!=fa)
		{
		   dfs1(tmp.to,z);
		   int cost = dp[tmp.to][0] + tmp.cap;
		   if(cost > max1)
		   {
		      max2 = max1; max1 = cost;	
		   }else max2 = max(max2,cost); 
		}
	}
	dp[z][0] = max1;
	dp[z][1] = max2;
	return ;
}
void dfs2(int z,int fa)
{
   	int dd = v[z].size();
   	for(int i=0; i<dd; i++)
   	{
   	  Node tmp = v[z][i];	
   	  if(tmp.to!=fa)
   	  {
   	  	dp[tmp.to][2] = max(dp[z][2], dp[tmp.to][0]+tmp.cap==dp[z][0] ? dp[z][1]:dp[z][0]) + tmp.cap;
	    dfs2(tmp.to,z);
	  }
	}
    return ;	
}

int main()  
{  
    while(cin >> n)  
    {  
        for(int i=2;i<=n;i++)  
        {  
            int x,y;  
            cin >> x >> y; 
            v[i].push_back(Node(x,y));
            v[x].push_back(Node(i,y));
        }  
        dfs1(1,0);  
        dfs2(1,0);   
        for(int i=1;i<=n;i++)  
        {  
            cout << max(dp[i][0],dp[i][2]) << endl; 
			 v[i].clear(); 
        } 
       memset(dp, 0, sizeof(dp));
    }  
    return 0;  
}