HDU 2196 Computer [树的直径]

Computer
Time Limit: 1000MS Memory Limit: 32768KB 64bit IO Format: %I64d & %I64u

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

---

求出任意点的最远点 O(n)

第一次从任意点dfs找出最远点 end1 ，第二次从end1开始dfs找出其最远点 end2 ， 同时边走边更新每个点的最远点 （因为每个点的最远点只可能是end1 或者 end2），然后第三次从end2开始dfs更新答案即可。。。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<string>
#include<iomanip>
#include<ctime>
#include<climits>
#include<cctype>
#include<algorithm>
#ifdef WIN32
#define AUTO "%I64d"
#else
#define AUTO "%lld"
#endif
using namespace std;
#define smax(x,tmp) x=max((x),(tmp))
#define smin(x,tmp) x=min((x),(tmp))
#define maxx(x1,x2,x3) max(max(x1,x2),x3)
#define minn(x1,x2,x3) min(min(x1,x2),x3)
const int INF=0x3f3f3f3f;
const int maxn = 10005;
struct Edge
{
    int to,next;
    int val;
}edge[maxn<<1];
int head[maxn];
int maxedge;
inline void addedge(int u,int v,int c)
{
    edge[++maxedge] = (Edge) { v,head[u],c };
    head[u] = maxedge;
    edge[++maxedge] = (Edge) { u,head[v],c };
    head[v] = maxedge;
}
int n;
int end1,end2,tmp;
int dis[maxn];
inline bool init()
{
    if(!~scanf("%d",&n)) return false;
    memset(head,-1,sizeof(head));
    maxedge=-1;
    for(int i=2;i<=n;i++)
    {
        int x,y;
        scanf("%d%d",&x,&y);
        addedge(x,i,y);
    }
    return true;
}
void dfs1(int u,int father,int d)
{
    if(tmp<d) tmp=d,end1=u;
    for(int i=head[u];~i;i=edge[i].next)
    {
        int v = edge[i].to;
        if(v==father) continue;
        dfs1(v,u,d+edge[i].val);
    }
}
void dfs2(int u,int father,int d)
{
    smax(dis[u],d);
    if(tmp<d) tmp=d,end2=u;
    for(int i=head[u];~i;i=edge[i].next)
    {
        int v = edge[i].to;
        if(v==father) continue;
        dfs2(v,u,d+edge[i].val);
    }
}
void dfs3(int u,int father,int d)
{
    smax(dis[u],d);
    for(int i=head[u];~i;i=edge[i].next)
    {
        int v = edge[i].to;
        if(v==father) continue;
        dfs3(v,u,d+edge[i].val);
    }
}
void work()
{
    memset(dis,0,sizeof(dis));
    tmp=0;
    dfs1(1,-1,0);
    tmp=0;
    dfs2(end1,-1,0);
    tmp=0;
    dfs3(end2,-1,0);
    for(int i=1;i<=n;i++) printf("%d\n",dis[i]);
}
int main()
{
    freopen("computer.in","r",stdin);
    freopen("computer.out","w",stdout);
    while(init())
        work();
    return 0;
}