Codeforces Round #615 (Div. 3)F (树的直径)
题目
题目大意
给你一个无根树,让你在无根树上找三个点,使这三个点之间的最短路径最长,sample中点1,5,6最短路径长度是5,是树中最长的
思路
一开始很多概念都不懂,比如树的直径就不知道,题解说了一句树的直径,百度了一下概念就很简单
树的直径:给定一棵树,树中每条边都有一个权值,树中两点之间的距离定义为连接两点的路径边权之和。树中最远的两个节点之间的距离被称为树的直径,连接这两点的路径被称为树的最长链
那么这一题就很简单了,就是找到树的直径,记录树中每一个点到两个端点的距离,最后枚举每一个点,找到距离最长的就行了,那么第二个难点就在于如何算出这三个点的距离,有一个解法特别的妙,假设我树的直径端点是a,b,我要枚举c,那么就是找
{
(
d
i
s
a
b
+
d
i
s
a
c
+
d
i
s
b
c
)
/
2
}
m
a
x
\ \{(dis_{ab} + dis_{ac} + dis_{bc})/2\}_{max}
{(disab+disac+disbc)/2}max(太神奇了)
代码
#include <iostream>
#include <cstdio>
#include <set>
#include <list>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <string>
#include <sstream>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <fstream>
#include <iomanip>
using namespace std;
#define dbg(x) cerr << #x " = " << x <<endl;
typedef pair<int, int> P;
typedef long long ll;
const int MAXN = 2e5+5;
vector<int> v[MAXN];
int dis[MAXN], disa[MAXN], disb[MAXN];
void bfs(int st)
{
memset(dis, 0, sizeof(dis));
queue<int> q;
q.push(st);
int vis[MAXN] ={0};
vis[st] = 1;
dis[st] = 0;
while(!q.empty())
{
int now = q.front();
int next;
q.pop();
for(int i = 0; i < v[now].size(); i++)
{
if(vis[v[now][i]] == 0)
{
next = v[now][i];
vis[next] = 1;
q.push(next);
dis[next] = dis[now] + 1;
}
}
}
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
for(int i = 1; i < n; i++)
{
int uu, vv;
cin >> uu >>vv;
v[vv].push_back(uu);
v[uu].push_back(vv);
}
bfs(1);
//cout << 'good' << endl;
int a, max_dis = -1;
for(int i = 1; i <= n; i++)
{
if(dis[i] > max_dis)
{
a = i;
max_dis = dis[i];
}
}
bfs(a);
int b;
max_dis = -1;
for(int i = 1; i <= n; i++)
{
disa[i] = dis[i];
if(dis[i] > max_dis)
{
b = i;
max_dis = dis[i];
}
}
bfs(b);
for(int i = 1; i <= n; i++)
{
disb[i] = dis[i];
}
int c;
max_dis = -1;
for(int i = 1; i <= n; i++)
{
if(disa[i] + disb[i] + disa[b] > max_dis && i!=a && i != b)
{
c = i;
max_dis = disa[i] + disb[i] + disa[b];
}
}
cout << max_dis/2 << endl << a << ' ' <<b << ' ' <<c <<endl;
}