题目链接:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=5374
题意:给一颗树, 每条边的权值都是1, 问选取两个点, 使得树上所有点到最近的一个点的距离的最大值最小是多少
思路:最大值最小,应该是用二分,而出于贪心,这两个点应该是在树的直径上,那么便对称式的二分距离树径端点距离为X的点,看是否能满足条件
#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <queue>
#include <cstdlib>
#include <ctime>
#include <cmath>
using namespace std;
#define N 200010
int t, n, m;
struct ege
{
int v, nxt;
} e[N * 2];
int head[N], cnt;
int dis[N], pre[N];
int rou[N];
void add(int u, int v)
{
e[cnt].v = v;
e[cnt].nxt = head[u];
head[u] = cnt++;
}
int bfs(int s)
{
memset(dis, -1, sizeof(dis));
memset(pre, -1, sizeof(pre));
int pos = s, val = 0;
queue <int> que;
que.push(s);
dis[s] = 0;
while (!que.empty())
{
int u = que.front();
que.pop();
for (int i = head[u]; ~i; i = e[i].nxt)
{
int v = e[i].v;
if (dis[v] == -1)
{
pre[v] = u;
dis[v] = dis[u] + 1;
que.push(v);
if (dis[v] > val)
{
val = dis[v];
pos = v;
}
}
}
}
return pos;
}
int flag[N];
bool ok(int ans)
{
memset(flag, 0, sizeof(flag));
bfs(rou[ans]);
for (int i = 1; i <= n; i++)
{
if (dis[i] <= ans)
flag[i] = 1;
}
bfs(rou[m - 1 - ans]);
for (int i = 1; i <= n; i++)
{
if (dis[i] <= ans)
flag[i] = 1;
}
for (int i = 1; i <= n; i++)
{
if (!flag[i])
return false;
}
return true;
}
int main()
{
scanf("%d", &t);
while (t--)
{
cnt = 0;
memset(head, -1, sizeof(head));
int u, v;
scanf("%d", &n);
for (int i = 1; i < n; i++)
{
scanf("%d%d", &u, &v);
add(u, v);
add(v, u);
}
u = bfs(1);
v = bfs(u);
m = 0;
while (v != -1)
{
rou[m++] = v;
v = pre[v];
}
int l = 0, r = m - 1, mid, ans[3];
while (l <= r)
{
mid = (l + r) / 2;
if (ok(mid))
{
ans[0] = mid;
ans[1] = rou[mid];
ans[2] = rou[m - 1 - mid];
if (ans[1] == ans[2])
{
for (int i = 0; i < m; i++)
{
if (rou[i] != ans[1])
{
ans[2] = rou[i];
break;
}
}
}
r = mid - 1;
}
else
l = mid + 1;
}
printf("%d %d %d\n", ans[0], ans[1], ans[2]);
}
return 0;
}