LightOJ - 1094 Farthest Nodes in a Tree(树的直径)

题目大意：给你一棵树，问树上两个结点的最远距离

解题思路：先用0做根结点，找出最远的叶子结点。再已该叶子结点做根结点，就能找到最远的距离了

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long LL;
const int N = 30010;

struct Edge{
    int u, v, next;
    LL dis;
    Edge() {}
    Edge(int u, int v, LL dis, int next): u(u), v(v), dis(dis), next(next) {}
}E[2 * N];

int n, tot, cas = 1, pos;
LL max1 ;
int head[N], dis[N];

void AddEdge(int u, int v, LL dis) {
    E[tot] = Edge(u, v, dis, head[u]);
    head[u] = tot++;
    E[tot] = Edge(v, u, dis, head[v]);
    head[v] = tot++;
}

void init() {
    memset(head, -1, sizeof(head));
    tot = 0;

    scanf("%d", &n);
    int u, v;
    LL dis;
    for (int i = 0; i < n - 1; i++) {
        scanf("%d%d%lld", &u, &v, &dis);
        AddEdge(u, v, dis);
    }
}

void dfs(int u, int fa, LL dis) {
    int child = 0;
    for (int i = head[u]; ~i; i = E[i].next) {
        int v = E[i].v;
        if (v == fa) continue;
        child++;
        dfs(v, u, dis + E[i].dis);
    }

    if (child == 0 && dis > max1) {
        pos = u;
        max1 = dis;
    }
    return ;
}

void solve() {
    max1 = 0;
    dfs(0, -1, 0);
    max1 = 0;
    dfs(pos, -1, 0);
    printf("Case %d: %lld\n", cas++, max1);
}

int main() {
    int test;
    scanf("%d", &test);
    while (test--) {
        init();
        solve();
    }
    return 0;
}