题意
对于树中的每一个结点,输出树中与其距离最远的结点的距离值。
题解
分析:
(以1为根节点的树中, 为了方便dfs)
对于每一个点 u, 其ans的构成:
1.子树中最长的那条链(向下走)
2.通过父亲fa[u]的那条链(向上走)
1):fa[u] 子树中的最长(或次长)链
若 u 本就是 fa[u]对应的最长链,就是去次长
2):fa[u] 继续往上走的最优值
ans[u] = max(向下走,向上走)
可以发现,1.对应的是子节点更新父节点, 2.对应的是父节点更新子节点
状态定义:
down[u][0]: u子树的次长链
down[u][1]: u子树的最长链
up[u]: 向上走的最优值
状态转移:
第一次dfs求出 down[u], son[u](u 对应的最长链) [类似长链剖分]
第二次dfs求出 up[u]:
if(v == son[u]) up[v] = max(down[u][0], up[u]) + w
else up[v] = max(down[u][1], up[u]) + w
目标状态:
ans[u] = max(down[u][1], up[u]);
Code
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
#define read(a) scanf("%d", &a)
#define readl(a) scanf("%lld", &a)
#define readf(a) scanf("%lf", &a)
#define readc(a) scanf("%c", &a)
#define reads(a) scanf("%s", a)
#define Buff ios::sync_with_stdio(false)
#define mem(a) memset(a, 0, sizeof a)
#define pb push_back
const int INF = 1e9 + 7;
const int N = 1e5 + 7;
const int M = 1e6 + 7;
const ll mod = 1e9 + 7;
vector<pair<int, int>> G[N];
int down[N][2], up[N], son[N], dis[N];
void dfs_1(int u, int anc)
{
int maxd = -INF, mmaxd = -INF;
for(auto now : G[u])
{
int v = now.first, w = now.second;
if(v == anc) continue;
dfs_1(v, u);
int dd = down[v][1] + w;
if(dd >= maxd) mmaxd = maxd, maxd = dd, son[u] = v;
else if(dd > mmaxd) mmaxd = dd;
}
down[u][0] = mmaxd;
down[u][1] = maxd;
if(maxd <= -INF) down[u][1] = 0;
}
void dfs_2(int u, int anc)
{
for(auto now : G[u])
{
int v = now.first, w = now.second;
if(v == anc) continue;
if(v == son[u]) up[v] = max(up[u], down[u][0]) + w;
else up[v] = max(up[u], down[u][1]) + w;
dfs_2(v, u);
}
}
signed main()
{
#ifndef ONLINE_JUDGE
freopen("_0.txt", "r", stdin);
#endif
Buff;
int n;
while(cin >> n)
{
for(int i = 1; i <= n; i++) G[i].clear();
for(int v = 2, u, w; v <= n ; v ++)
{
cin >> u >> w;
G[u].push_back(make_pair(v, w));
G[v].push_back(make_pair(u, w));
}
dfs_1(1, 0);
up[1] = 0;
dfs_2(1, 0);
for(int i = 1; i <= n; i++)
cout << max(up[i], down[i][1]) << "\n";
}
return 0;
}