Codeforces1294F. Three Paths on a Tree 树的直径

https://www.cnblogs.com/overrate-wsj/p/12231134.html

#include<bits/stdc++.h>
using namespace std;
const int maxn=2e5+5;
#define pb push_back
typedef long long ll;
int n,x,y;
vector<int> v[maxn];
int vis[maxn],dis[maxn],dis1[maxn],dis2[maxn],pos;
void bfs(int x){
	memset(vis,0,sizeof vis);
	memset(dis,0,sizeof dis);
	vis[x]=1;
	dis[x]=0;
	queue<int> q;
	q.push(x);
	while(!q.empty()){
		int u=q.front();q.pop();
		for(int i=0;i<v[u].size();i++){
			if(!vis[v[u][i]]){
				vis[v[u][i]]=1;
				dis[v[u][i]]=dis[u]+1;
				q.push(v[u][i]);
				if(dis[v[u][i]]>dis[pos]) pos=v[u][i];
			}
		}
	}
}
int main(){
	cin>>n;
	for(int i=1;i<n;i++){
		cin>>x>>y;
		v[x].pb(y);
		v[y].pb(x);
	}
	
	int a,b;
	bfs(1);
	a=pos;//1-a dis
	bfs(a);
	b=pos;//a-b
	for(int i=1;i<=n;i++) dis1[i]=dis[i];
	bfs(b);//b-a
	for(int i=1;i<=n;i++) dis2[i]=dis[i];
	int c=0;
	for(int i=1;i<=n;i++){
		if(dis1[i]+dis2[i]>dis1[c]+dis2[c] && i!=a && i!=b) c=i;
		
	}
	int ans=(dis1[b]+dis1[c]+dis2[c])/2;//a,b,c之间的边数 a-b a-c b-c算了2遍 
	cout<<ans<<endl<<a<<" "<<b<<" "<<c<<endl;
	return 0;
}