传送门
题目描述
给你一棵树,让你求每一个点离得最远的点的距离
分析
首先分析一下离点 u u u最远的点可能在哪里
- 在以
u
u
u为根的子树中
这种情况比较好处理,处理出来每一个子节点的最远距离就好了 - 在非子树的部分
那么必然 u u u要连接到父节点 f a fa fa,那么就有两种情况了,一种是继续向上,一种是走向 f a fa fa点的子节点,如果 u u u在 f a fa fa节点中的向下最大路径中,就走次大路径,否则走最大路径
代码
#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 10;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
int h[N],ne[N],e[N],w[N],idx;
int l_d[N][2],l_u[N];
int n;
void add(int x,int y,int z){
ne[idx] = h[x],e[idx] = y,w[idx] = z,h[x] = idx++;
}
void dfs(int u,int fa){
l_d[u][0] = l_d[u][1] = 0,l_u[u] = 0;
for(int i = h[u];~i;i = ne[i]){
int v = e[i];
if(v == fa) continue;
dfs(v,u);
if(l_d[u][0] < l_d[v][0] + w[i]){
l_d[u][1] = l_d[u][0];
l_d[u][0] = l_d[v][0] + w[i];
}
else if(l_d[u][1] < l_d[v][0] + w[i]){
l_d[u][1] = l_d[v][0] + w[i];
}
}
}
void dfs(int u,int fa,int res){
if(u != fa){
l_u[u] = max(l_u[u],res + l_u[fa]);
if(l_d[fa][0] == l_d[u][0] + res) l_u[u] = max(l_u[u],res + l_d[fa][1]);
else l_u[u] = max(l_u[u],res + l_d[fa][0]);
}
for(int i = h[u];~i;i = ne[i]){
int v = e[i];
if(v == fa) continue;
dfs(v,u,w[i]);
}
}
int main() {
while(~scanf("%d",&n)){
memset(h,-1,sizeof h);
for(int i = 2;i <= n;i++){
int x,y;
read(x),read(y);
add(i,x,y),add(x,i,y);
}
dfs(1,0);
dfs(1,0,0);
for(int i = 1;i <= n;i++) di(max(l_u[i],l_d[i][0]));
}
}
/**
* ┏┓ ┏┓+ +
* ┏┛┻━━━┛┻┓ + +
* ┃ ┃
* ┃ ━ ┃ ++ + + +
* ████━████+
* ◥██◤ ◥██◤ +
* ┃ ┻ ┃
* ┃ ┃ + +
* ┗━┓ ┏━┛
* ┃ ┃ + + + +Code is far away from
* ┃ ┃ + bug with the animal protecting
* ┃ ┗━━━┓ 神兽保佑,代码无bug
* ┃ ┣┓
* ┃ ┏┛
* ┗┓┓┏━┳┓┏┛ + + + +
* ┃┫┫ ┃┫┫
* ┗┻┛ ┗┻┛+ + + +
*/