题目链接:http://acm.split.hdu.edu.cn/showproblem.php?pid=2196
题意:求树上每个点与另一点的最远距离
题解:
设dp[i][0]为第i个结点的子树最远叶子结点距离,dp[i][1]为第i个结点的子树次远叶子结点距离,dp[i][2]为第i个结点通过父结点能到的最远距离。
两次dfs,第一次保存dp[i][0]与dp[i][1]
第二次求dp[i][2],要注意求dp[i][2]时要判断父节点的最远叶子结点是否在i结点的子树上,如果在则dp[i][2] = max(dp[fa][2], dp[fa][1])+c否则dp[i][2] = max(dp[fa][2], dp[fa][0])+c
#pragma comment(linker, "/STACK:102400000,102400000")
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<cmath>
#include<stdlib.h>
#include <string.h>
#include<queue>
#include<set>
#include<map>
#include<stack>
#include<time.h>
#include<sstream>
using namespace std;
#define MAX_N 50005
#define inf 0x7f7f7f7f
#define LL long long
#define ull unsigned long long
const LL INF = 1e18;
//const double Pi = acos(-1);
const int mod = 1e4+7;
typedef pair<int, int>P;
vector<P>G[MAX_N];
int dp[MAX_N][3];
void dfs1(int u, int pre)
{
dp[u][0] = dp[u][1] = dp[u][2] = 0;
for(int i=0; i<G[u].size(); i++) {
int v = G[u][i].first;
int c = G[u][i].second;
if(v == pre)
continue;
dfs1(v, u);
if(dp[v][0]+c > dp[u][0]) {
dp[u][1] = dp[u][0];
dp[u][0] = dp[v][0]+c;
}
else if(dp[v][0]+c == dp[u][0]) {
dp[u][1] = dp[u][0];
}
else if(dp[v][0]+c > dp[u][1]) {
dp[u][1] = dp[v][0]+c;
}
}
}
void dfs2(int u, int pre)
{
for(int i=0; i<G[u].size(); i++) {
int v = G[u][i].first;
int c = G[u][i].second;
if(v == pre)
continue;
if(dp[u][0] == dp[v][0]+c)
dp[v][2] = max(dp[u][2], dp[u][1])+c;
else
dp[v][2] = max(dp[u][2], dp[u][0])+c;
dfs2(v, u);
}
}
int main()
{
int n;
while(cin >> n) {
for(int i=1; i<=n; i++)
G[i].clear();
for(int i=2; i<=n; i++) {
int a, b;
scanf("%d%d", &a, &b);
G[i].push_back(P(a, b));
G[a].push_back(P(i, b));
}
dfs1(1, 0);
dfs2(1, 0);
for(int i=1; i<=n; i++) {
printf("%d\n", max(dp[i][0], dp[i][2]));
}
}
}