HDOJ-2196 Computer

这道题是求从树的每个点出发的最长链长度。先任选一个点a, 从a深搜找到距它最远的点b，再从b开始深搜找到距b最远的点c，则b和c的距离则为树的直径。接下来求树上每个点到b的距离p1[], 到c的距离p2[]，那么第i个点出发的最长链长度为max(p1[i], p2[i]).

#include <cstdio>
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#include <queue>
#define maxn 10005
using namespace std;
typedef long long ll;

struct Edge{
    Edge(int a, int b, int c){
        k1 = a;
        k2 = b;
        d = c;
    }
    int k1, k2;
    int d;
};
vector<Edge> edge;
vector<int> v[maxn];
int d, p1[maxn], p2[maxn];
void dfs(int h, int &k, int vv, int f, int *p){

    for(int i = 0; i < v[h].size(); i++){

        Edge &e = edge[v[h][i]];
        if(e.k2 != f){
        p[e.k2] = p[h] + e.d;
        dfs(e.k2, k, vv+e.d, h, p);
       }
   }
   if(d < vv){
    d = vv;
    k = h;
   }
}

int main(){

//  freopen("in.txt", "r", stdin);
    int n;

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

        int a, b;
        for(int i = 1; i <= n; i++)
          v[i].clear();
        edge.clear();
        for(int i = 2; i <= n; i++){
            scanf("%d%d", &a, &b);
            edge.push_back(Edge(i, a, b));
            edge.push_back(Edge(a, i, b));
            int m = edge.size();
            v[i].push_back(m-2);
            v[a].push_back(m-1);
        }
        int s, e;
        d = -1;
        dfs(1, s, 0, -1, p2);
        d = -1;
        p1[s] = 0;
        dfs(s, e, 0, -1, p1);
        p2[e] = 0;
        dfs(e, s, 0, -1, p2);
        for(int i = 1; i <= n; i++){
            printf("%d\n", max(p1[i], p2[i]));
        }
    }

    return 0;
}