树的直径
设 d x d_x dx 表示以 x x x 为根节点到这棵树中最远的距离,显然有:
d x = max e x t o y i ∈ E x { d y i + v a l u e ( e ) } d_x = \max_{e_{x \; to \; y_i} \in E_x} \{ d_{y_i} + value(e) \} dx=extoyi∈Exmax{dyi+value(e)}
设 f x f_x fx 表示经过 x x x 的最长链的长度,我们可以发现他就可以拆成四个部分:
- x t o y i x \; to \; y_i xtoyi
- y i y_i yi 到以 y i y_i yi 为根的最长距离
- x t o y j x \; to \; y_j xtoyj
- y j y_j yj 到以 y j y_j yj 为根的最长距离
那么就有:
f x = max e i x t o y i ∈ E , e j x t o y j ∈ E { d y i + d y j + v a l u e ( e i ) + v a l u e ( e j ) } f_x = \max_{e_{i_{x \; to \; y_i}} \in E, e_{j_{x \; to \;y_j}} \in E} \{ d_{y_i} + d_{y_j} + value(e_i) + value(e_j) \} fx=eixtoyi∈E,ejxtoyj∈Emax{dyi+dyj+value(ei)+value(ej)}
#include<bits/stdc++.h>
using namespace std;
#define in read()
#define MAXN 500500
#define MAXM 4 * MAXN
inline int read(){
int x = 0; int f = 1; char c = getchar();
while(c < '0' or c > '9'){
if(c == '-') f = -1; c = getchar();
}
while('0' <= c and c <= '9'){
x = x * 10 + c - '0'; c = getchar();
}
return f * x;
}
int tot = 0;
int first[MAXN] = { 0 };
int nxt[MAXM] = { 0 };
int to[MAXM] = { 0 };
int value[MAXM] = { 0 };
inline void add(int x, int y, int weight){
nxt[++tot] = first[x];
first[x] = tot; to[tot] = y;
value[tot] = weight;
}
int n = 0;
int v[MAXN] = { 0 };
int d[MAXN] = { 0 };
int ans = 0;
void dp(int x){
v[x] = 1;
for(int e = first[x]; e; e = nxt[e]){
int y = to[e];
if(v[y]) continue;
dp(y);
ans = max(ans, d[x] + d[y] + value[e]);
d[x] = max(d[x], d[y] + value[e]);
}
}
int main(){
n = in;
for(int i = 1; i < n; i++){
int x = in, y = in, w = in;
add(x, y, w); add(y, x, w);
}
dp(1);
cout << ans << '\n';
return 0;
}