传送门
题目描述
在一棵树内找三个点x,y,z,要求三个点之间的距离最大,
分析
首先我们可以找到这棵树内的直径,然后去去找另一点到这棵树上的直径最短
我一开始的思路是三次bfs,求出直径的端点,并且处理出每一个点到直径两个端点的距离,然后去给每一个符合d1[x] + d2[x] == d (d为树的直径)的点打上标记,然后乱搞,后来发现这样做麻烦了
我们直接求每一个点到直径两端的距离,然后再加上直径的长度,这样其实就是每个距离多加了一遍,最后整体除以2就可以了
代码
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <queue>
#include <cstring>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define _CRT_SECURE_NO_WARNINGS
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zero-upper")
#pragma GCC target("avx2")
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PII;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 10,M = 4e5 + 10;
int h[N],ne[M],e[M],idx;
int st[N];
int is[N];
int d1[N],d2[N];
int d[N];
int n;
void add(int x,int y){
ne[idx] = h[x],e[idx] = y,h[x] = idx++;
}
int main(){
int x = 0,y = 0,z = 0;
int ans = 0;
memset(h,-1,sizeof h);
scanf("%d",&n);
for(int i = 1;i < n;i++){
int x,y;
scanf("%d%d",&x,&y);
add(x,y),add(y,x);
}
queue<int> Q;
Q.push(1);
st[1] = true;
while(Q.size()){
int t = Q.front();
Q.pop();
for(int i = h[t];~i;i = ne[i]){
int j = e[i];
if(st[j]) continue;
d1[j] = d1[t] + 1;
st[j] = true;
Q.push(j);
}
}
for(int i = 1;i <= n;i++)
if(d1[i] > d1[x]) x = i;
Q.push(x);
memset(st,0,sizeof st);
st[x] = true;
while(Q.size()){
int t = Q.front();
Q.pop();
for(int i = h[t];~i;i = ne[i]){
int j = e[i];
if(st[j]) continue;
st[j] = true;
d2[j] = d2[t] + 1;
Q.push(j);
}
}
for(int i = 1;i <= n;i++)
if(d2[i] > d2[y]) y = i;
Q.push(y);
memset(st,0,sizeof st);
st[y] = true;
d1[y] = 0;
while(Q.size()){
int t = Q.front();
Q.pop();
for(int i = h[t];~i;i = ne[i]){
int j = e[i];
if(st[j]) continue;
st[j] = true;
d1[j] = d1[t] + 1;
Q.push(j);
}
}
int back = 0;
for(int i = 1;i <= n;i++){
if(i == x || i == y) continue;
back = (d1[i] + d2[i] + d1[x]) / 2;
if(back > ans){
ans = back;
z = i;
}
}
printf("%d\n",ans);
printf("%d %d %d\n",x,y,z);
return 0;
}
/**
* ┏┓ ┏┓+ +
* ┏┛┻━━━┛┻┓ + +
* ┃ ┃
* ┃ ━ ┃ ++ + + +
* ████━████+
* ◥██◤ ◥██◤ +
* ┃ ┻ ┃
* ┃ ┃ + +
* ┗━┓ ┏━┛
* ┃ ┃ + + + +Code is far away from
* ┃ ┃ + bug with the animal protecting
* ┃ ┗━━━┓ 神兽保佑,代码无bug
* ┃ ┣┓
* ┃ ┏┛
* ┗┓┓┏━┳┓┏┛ + + + +
* ┃┫┫ ┃┫┫
* ┗┻┛ ┗┻┛+ + + +
*/