1021 Deepest Root (25 分)

#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <vector>
using namespace std;
const int maxn = 10010;
vector<int> G[maxn], temp, ans;
int N;
int used[maxn];
int maxh = -1;
void dfs(int u, int deep){
	used[u] = 1;
	if(maxh < deep){
		maxh = deep;
		temp.clear();
		temp.push_back(u);
	}else if(maxh == deep){
		temp.push_back(u);
	}
	int v;
	for(int i = 0; i < G[u].size(); i++){
		v = G[u][i];
		if(used[v] == 0){
			dfs(v, deep+1);
		} 
	}
}
void solve(){
	memset(used, 0, sizeof(used));
	dfs(1, 1);
	ans = temp;
	memset(used, 0, sizeof(used));
	dfs(ans[0], 1);
	for(int i = 0; i < temp.size(); i++){
		ans.push_back(temp[i]);
	}
	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]);
	}
}
int countk(){
	int k = 0;
	memset(used, 0, sizeof(used));
	for(int i = 1; i <= N; i++){
		if(used[i] == 0){
			dfs(i, 1);
			k++;
		}
	}
	return k;
}
int main(){
	scanf("%d", &N);
	int x, y;
	for(int i = 0; i < N-1; i++){
		scanf("%d %d", &x, &y);
		G[x].push_back(y);
		G[y].push_back(x);
	}
	int k = countk();
	if(k > 1){
		printf("Error: %d components\n", k);
		return 0;
	} 
	solve();		
	return 0;
}