P3304 [sdoi2013] diameter (diameter of tree)

[SDOI2013] The diameter of - Luogu https://www.luogu.com.cn/problem/P3304 Run first on this topic dfs Find any diameter , And record the path and the endpoints at both ends , First enumerate each point on the diameter starting from the left end point , Record the maximum path value of other paths at this point （ A road with a different diameter ）, Then start to find out whether these maximum path values are equal to the original one （ It's equivalent to whether the forked road is as long as the original ）, Then find the point , Then judge the distance from the right endpoint from this point （ Same as above ）

  The painting is very abstract , I hope it will help you understand

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <cmath>
#include <map>
#include <bitset>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1e6 + 10;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)
#define lowbit(x) ((x)&(-x))
using P = pair<int, int>;


int n;
int ver[MAXN];
int head[MAXN];
int nxt[MAXN];
ll cost[MAXN];
int last[MAXN];
int nxxt[MAXN];
ll dis[MAXN], mmm[MAXN], op;
bool vis[MAXN];
int u, v;
int cnt;
void add(int x, int y, ll c) {
	ver[++cnt] = y;
	cost[cnt] = c;
	nxt[cnt] = head[x];
	head[x] = cnt;
}

void dfs1(int o, ll p, int q) {
	if (p > op)
		op = p, u = o;
	for (int i = head[o]; i; i = nxt[i]) {
		if (ver[i] == q)
			continue;
		dfs1(ver[i], p + cost[i], o);
	}
}

void dfs2(int o, ll p, int q) {
	last[o] = q;
	dis[o] = p;
	if (p > op)
		op = p, v = o;
	for (int i = head[o]; i; i = nxt[i]) {
		if (ver[i] == q)
			continue;
		dfs2(ver[i], p + cost[i], o);
	}
}

void dfs(int o, ll p, int q) {
	if (p > op)
		op = p;
	for (int i = head[o]; i; i = nxt[i]) {
		if (vis[ver[i]] || ver[i] == q)
			continue;
		dfs(ver[i], p + cost[i], o);
	}
}

int main() {
	scanf("%d", &n);
	int x, y;
	ll c;
	for (int i = 1; i <= n - 1; i++) {
		scanf("%d %d %lld", &x, &y, &c);
		add(x, y, c);
		add(y, x, c);
	}
	dfs1(1, 0, 0);
	op = 0;
	dfs2(u, 0, 0);
	ll distance = dis[v];
	printf("%lld\n", distance);
	for (int i = v; i; i = last[i]) {
		vis[i] = 1;
	}
	for (int i = v; i; i = last[i]) {
		op = 0;
		dfs(i, 0, 0);
		mmm[i] = op;
	}
	for (int i = last[v], j = v; i; i = last[i]) {
		nxxt[i] = j, j = i;
	}
	int tmp;
	for (int i = u; i; i = nxxt[i]) {
		if (dis[v] - dis[i] == mmm[i]) {
			tmp = i;
			break;
		}
	}
	int ans = 0;
	for (int i = tmp; i; i = last[i]) {
		if (dis[i] == mmm[i])
			break;
		ans++;
	}
	printf("%d\n", ans);
	return 0;
}