树形dp, 重写一遍。还是wa了几发。有以下几个注意的点:1.没初始化;2.一开始有些错误导致超时,然后用vis数组记录了下访问,变成了wa,其实没必要,我的写法只是遍历一遍树。3.两台电脑之间的距离不是1,虽然样例给的是。。。fdp返回值应该是mv[x] + v[x],v[x]为当前节点与父亲节点的距离;4.1节点的fv不能更新,因为其父节点为自身,按fdp中更新后会另mvp[x]节点下的父节点过来的距离等于当前节点子节点最大距离加上当前节点到1节点距离乘2.
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
#define N 10005
typedef long long LL;
int n;
struct Node{
int a;
Node *next;
}e[N], *head[N];
int mv[N], mv2[N], par[N], mvp[N], fv[N], vis[N], v[N];
int ptr;
void init(){
for(int i = 0; i <= n; i++){
mv[i] = 0;
mv2[i] = 0;
par[i] = i;
head[i] = NULL;
mvp[i] = 0;
fv[i] = 0;
v[i] = 0;
ptr = 0;
}
}
void adde(int x, int y, int val){
e[ptr].a = x;
v[x] = val;
par[x] = y;
e[ptr].next = head[y];
head[y] = &e[ptr ++];
}
int tdp(int x){
Node *p = head[x];
int pp = 0;
while(p){
pp = tdp(p -> a);
if(pp > mv[x]){
mv2[x] = mv[x];
mv[x] = pp;
mvp[x] = p -> a;
}
else if(pp > mv2[x]){
mv2[x] = pp;
}
p = p -> next;
}
return mv[x] + v[x];
}
void fdp(int x){
if(x != 1){
int pp = par[x];
if(mvp[pp] != x)fv[x] = mv[pp] + v[x];
else fv[x] = mv2[pp] + v[x];
fv[x] = max(fv[pp] + v[x], fv[x]);
}
Node *p = head[x];
while(p){
fdp(p -> a);
p = p -> next;
}
}
int main(){
int x, val;
while(scanf("%d", &n) != EOF){
init();
for(int i = 2; i <= n; i++){
scanf("%d%d", &x, &val);
adde(i, x, val);
}
tdp(1);
fdp(1);
for(int i = 1; i <= n; i++){
printf("%d\n", max(fv[i], mv[i]));
}
}
return 0;
}