1021 Deepest Root

1021 Deepest Root （25 分)
A graph which is connected and acyclic can be considered a tree. The height of the tree depends on the selected root. Now you are supposed to find the root that results in a highest tree. Such a root is called the deepest root.

Input Specification:
Each input file contains one test case. For each case, the first line contains a positive integer N (≤10
​4
​​ ) which is the number of nodes, and hence the nodes are numbered from 1 to N. Then N−1 lines follow, each describes an edge by given the two adjacent nodes’ numbers.

Output Specification:
For each test case, print each of the deepest roots in a line. If such a root is not unique, print them in increasing order of their numbers. In case that the given graph is not a tree, print Error: K components where K is the number of connected components in the graph.

Sample Input 1:
5
1 2
1 3
1 4
2 5
Sample Output 1:
3
4
5
Sample Input 2:
5
1 3
1 4
2 5
3 4
Sample Output 2:
Error: 2 components
题意:给出N个结点与N-1条边。问：它们能否形成一颗N个结点的树？如果能，则从中选出结点作为树根，使得整棵树的高度最大。输出所以满足要求的可以作为树根的结点。

#include<cstdio>
#include<cstring>
#include<vector>
#include<algorithm>
using namespace std;
const int N=100010;
vector<int> G[N];//邻接表
bool isRoot[N];//记录每个人结点是否作为某个
int father[N];
int findFather(int x)
{
	//查找x所在集合的根结点
	int a=x;
	while(x!=father[x])
	{
		x=father[x];
	} 
	//路径压缩
	while(a!=father[a])
	{
		int z=a;
		a=father[a];
		father[z]=x;
	} 
	return x;
} 
void Union(int a,int b)
{
	int faA=findFather(a);
	int faB=findFather(b);
	if(faA!=faB)
	{
		father[faA]=faB;
	}
}
void init(int n)
{
	//并查集初始化
	for(int i=1;i<=n;i++)
	{
		father[i]=i;
	} 
}
int calBlock(int n)
{
	//计算连通块个数
	int Block=0;
	for(int i=1;i<=n;i++)
	{
		isRoot[findFather(i)]=true;//i的根结点是findFather[i] 
	} 
	for(int i=1;i<=n;i++)
	{
		Block+=isRoot[i];//累加根结点个数 
	}
	return Block;
}
int maxH=0;//最大高度
vector<int> temp,Ans;//temp临时存放DFS的最远结点结果，Ans保存答案
void DFS(int u,int Height,int pre)
{
	if(Height>maxH)
	{
		//如果获得了最大的树高
		temp.clear();//清空temp
		temp.push_back(u);//将当前结点u加入temp中
		maxH=Height;//将当前树高赋给maxH 
	}else if(Height==maxH)
	{
		temp.push_back(u);
		//如果树高等于最大树高，将当前结点加temp中 
	}
	for(int i=0;i<G[u].size();i++)
	{
		//遍历u的所有子结点
		//由于邻接表中存放无向图，因此需要跳过回去的边
		if(G[u][i]==pre) continue;
		DFS(G[u][i],Height+1,u);//访问子结点 
	} 
} 
int main()
{
	int a,b,n;
	scanf("%d",&n);
	init(n);//并查集初始化
	for(int i=1;i<n;i++)
	{
		scanf("%d%d",&a,&b);
		G[a].push_back(b);//边a->b
		G[b].push_back(a);//边b->a
		Union(a,b);//合并a和b所在的集合 
	} 
	int Block=calBlock(n);//计算集合数目
	if(Block!=1)
	{
		//不止一个连通块
		printf("Error: %d components\n",Block); 
	}else{
		DFS(1,1,-1);//从1号结点开始DFS,初始高度为1
		Ans=temp;//temp为集合A,赋给Ans
		DFS(Ans[0],1,-1);//从任意一个根结点开始遍历
		for(int i=0;i<temp.size();i++)
		{
			Ans.push_back(temp[i]);//此时temp为集合B,将其增加到Ans中 
		} 
		sort(Ans.begin(),Ans.end());//按编号从小到大排序
		printf("%d\n",Ans[0]);
		for(int i=1;i<Ans.size();i++)
		{
			if(Ans[i]!=Ans[i-1])
			{
				//重复编号不输出
				printf("%d\n",Ans[i]); 
			}
		} 
	}
	return 0;
}