HDU 2196 Computer 树dp 每个点树上最远距离

题意: 一些电脑连成一棵树, 问这个树上每个节点的最远距离是多少.

思路:

从根dfs到叶子, 开数组维护每个点到自己子树的叶子的最远和次远距离, 对于这两个距离还要记录是从哪个儿子节点来的.

再做一遍dfs, 每个节点用它父亲的最远/次远距离+到自己的距离更新自己的最远/次远距离(前提用来更新的父亲距离不是自己提供的).

代码:

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

const int M = 10005;
const int inf = 1e9 + 5;
int n;
struct node {
    int v, d, nxt;
} edge[M * 2];
int head[M];
int ei;

void addedge(int u, int v, int d) {
    edge[ei].v = v;
    edge[ei].d = d;
    edge[ei].nxt = head[u];
    head[u] = ei++;
}

int fa[M];
int dp[M][2];

int dis[M];

int r[M][2];//记录是从哪里来的


int dfs(int x) {
    int t1 = 0, t2 = 0;
    int r1 = 0, r2 = 0;
    for (int i = head[x]; i != -1; i = edge[i].nxt) {
        int v = edge[i].v;
        int t3 = dfs(v) + dis[v];
        if (t3 > t1) {
            t2 = t1;
            r2 = r1;
            t1 = t3;
            r1 = v;
        } else if (t3 > t2) {
            t2 = t3;
            r2 = v;
        }
    }
    dp[x][0] = t1;
    dp[x][1] = t2;
    r[x][0] = r1;
    r[x][1] = r2;
    return dp[x][0];
}


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

    for (int i = 2; i <= n; i++) {
        int u, d;
        scanf("%d%d", &u, &d);
        addedge(u, i, d);
        dis[i] = d;
        fa[i] = u;
    }
}

void dfs2(int x) {
    if (x != 1) {
        int f = fa[x];
        vector<pair<int, int> > v;
        v.push_back({dp[x][0], r[x][0]});
        v.push_back({dp[x][1], r[x][1]});
        for (int i = 0; i <= 1; i++) {
            if (r[f][i] != x) {
                v.push_back({dp[f][i] + dis[x], f});
            } else {
                v.push_back({dis[x], f});
            }
        }
        sort(v.begin(), v.end());
        dp[x][0] = v[v.size() - 1].first;
        dp[x][1] = v[v.size() - 2].first;
        r[x][0] = v[v.size() - 1].second;
        r[x][1] = v[v.size() - 2].second;
    }
    for (int i = head[x]; i != -1; i = edge[i].nxt) {
        int v = edge[i].v;
        dfs2(v);
    }
}


void solve() {
    dfs(1);
    for (int i = 1; i <= n; i++) {
        if (dp[i][0] == 0)dp[i][0] = -inf;
        if (dp[i][1] == 0)dp[i][1] = -inf;
    }
/*    for (int i = 1; i <= n; i++) {
        printf("%d %d\n", dp[i][0], dp[i][1]);
    }*/
    dfs2(1);
/*    for (int i = 1; i <= n; i++) {
        printf("%d %d\n", dp[i][0], dp[i][1]);
    }*/
    for (int i = 1; i <= n; i++) {
        printf("%d\n", dp[i][0]);
    }
}

int main() {
    while (~scanf("%d", &n)) {
        init();

        solve();
/*        debug(dp[1][0], r[1][0]);
        debug(dp[1][1], r[1][1]);
        debug(dp[2][0], r[2][0]);
        debug(dp[2][1], r[2][1]);*/
    }

    return 0;
}