ACM-ICPC国际大学生程序设计竞赛北京赛区(2017)网络赛 Agent Communication(图论)

描述

In Peking University, there are many homeless cats. The students of cat club built n nests and some paths for those cats. A path connects two nests directly. All nests are connected by paths and there is only one route between any two nests.

Li Lei is the chief of the cat club. He just got some donation for the cats. So he decides to build a new path which connects two nests to make cats travel more easily. He hopes that after the new path is built, the maximum distance between two nests becomes as short as possible. The distance between two nests is defined as the number of paths along the route between two nests.

Can you help Li Lei to figure out how to build the new path?

输入

The first line of input contains an integer t(t ≤ 50), the number of test cases. Then t test cases follow.

For each case:

The first line of input contains an integer n(n ≤ 1000), the number of nests.

Among the next n-1 lines, each line contains two integer x and y (1 ≤ x, y ≤ n), meaning that there is a path between the x-th nest and the y-th nest.

输出

For each test case, output one integer, the maximum distance of two nests after the new path is built correctly.

样例提示

case 1: build a path between 1 and 5

case 2: build a path between 3 and 5

样例输入

2
6
1 2
2 3
3 4
4 5
3 6
7
1 3
2 3
3 4
4 5
5 6
5 7

样例输出

3
3

分析:这是一道原题(hdu-5699货物运输),不过货物运输中给的是一条链.
链上解法见:http://blog.csdn.net/tc_to_top/article/details/51476095
现在给你的是一棵树,我们考虑树中的直径,可以证明最优解一定存在于直径上两点,所以我们可以先求出来任意一条直径,然后同货物运输。

#include<bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
const int N = 1005;
int n,Time,S,T,len,d[N],p[N],dis[N],length[N][N];
bool flag,vis[N];
vector<int> G[N];
void DIS(int u,int fa,int head,int deep)
{
	length[head][u] = deep;
	for(int v : G[u])
	 if(v != fa) DIS(v,u,head,deep+1);
}
void dfs(int u,int fa,int deep,int &t)
{
	if(deep > len)
	{
		len = deep;
		t = u;
	}
	for(int v : G[u])
	 if(v != fa) dfs(v,u,deep+1,t);
}
void dfs2(int u,int fa,int deep)
{
	d[deep] =  u;
	if(u == T) 
	{
		flag = true;
		return;
	}
	for(int v : G[u])
	 if(!flag && v != fa) dfs2(v,u,deep+1);
}
void dfs3(int u,int fa,int deep,int head)
{
	p[u] = head;
	dis[u] = deep;
	for(int v : G[u])
	 if(v != fa && !vis[v]) dfs3(v,u,deep+1,head);  
}
bool check(int mid)
{
	int ma1 = -INF,ma2 = -INF,mi1 = INF,mi2 = INF;
	for(int i = 1;i < n;i++)
	 for(int j = i+1;j <= n;j++)
	 {
		 if(length[i][j] <= mid) continue;
		 int x = i,y = j,temp = dis[i] + dis[j] + 1;
		 if(p[x] > p[y]) swap(x,y);
		 ma1 = max(p[x] + p[y] - (mid - temp),ma1);
		 ma2 = max(p[y] - p[x] - (mid - temp),ma2);
		 mi1 = min(p[x] + p[y] + mid - temp,mi1);
		 mi2 = min(p[y] - p[x] + mid - temp,mi2);
	 }
	if(mi1 < 0 || mi2 < 0) return false;
	if(ma1 > mi1 || ma2 > mi2) return false;
	if(mi1 < ma2) return false;
	if(ma1 == mi1 && ma2 == mi2 && ((ma1 + ma2) & 1)) return false;
	return true;  
}
int main()
{
	scanf("%d",&Time);
	while(Time--)
	{
		memset(vis,0,sizeof(vis));
		scanf("%d",&n);
		for(int i = 1;i <= n;i++) G[i].clear();
		for(int i = 1;i < n;i++)
		{
			int u,v;
			scanf("%d%d",&u,&v);
			G[u].push_back(v);
			G[v].push_back(u);
		}
		for(int i = 1;i <= n;i++) DIS(i,0,i,0);
		len = 0;
		dfs(1,0,1,S);
		len = 0;
		dfs(S,0,1,T);
		flag = false;
		dfs2(S,0,1);
		for(int i = 1;i <= len;i++) vis[d[i]] = true;
		for(int i = 1;i <= len;i++) dfs3(d[i],0,0,i);
		int l = 0,r = n;
		while(l != r)
		{
			int mid = (l+r)>>1;
			if(check(mid)) r = mid;
			else l = mid+1;
		}
		cout<<l<<endl;
	}
}
/*/
2
6
1 2
2 3
3 4
4 5
3 6
7
1 3
2 3
3 4
4 5
5 6
5 7
/*/