题意:求树的直径。
#include <iostream>
#include <algorithm>
#include <cstring>
#define maxn 401000*11
#define ll long long
using namespace std;
const int N = 1e5 + 10;
int n, h[N], cnt, x, y, z, dis[N], vis[N], d;
struct node {
int v, w, net;
} no[N];
void add(int u, int v, int w) {
no[cnt].v = v;
no[cnt].w = w;
no[cnt].net = h[u];
h[u] = cnt++;
}
void dfs(int u) {
vis[u] = 1;
for(int i = h[u]; ~i; i = no[i].net) {
int v = no[i].v;
if(!vis[v]) {
dis[v] = dis[u] + no[i].w;
dfs(v);
}
}
}
int main() {
memset(h, -1, sizeof h);
memset(dis, 0x3f, sizeof dis);
while(cin >> x >> y >> z) {
add(x, y, z);
add(y, x, z);
d = max(max(d, x), y);
}
dis[1] = 0;
dfs(1);
int maxx = 0, s;
for(int i = 1; i <= d; i++) {
if(dis[i] > maxx && dis[i] != 0x3f3f3f3f) {
maxx = dis[i];
s = i;
}
}
memset(dis, 0x3f, sizeof dis);
memset(vis, 0, sizeof vis);
dis[s] = 0;
dfs(s);
maxx = 0;
for(int i = 1; i <= d; i++)
if(dis[i] > maxx && dis[i] != 0x3f3f3f3f)
maxx = dis[i];
cout << maxx << endl;
return 0;
}