先附上树的重心的定义:
这个题目的意思就是求树的重心,如果有多个,按照节点编号升序输出啦~
/***********************************************
* Author: fisty
* Created Time: 2015/2/22 14:40:22
* File Name : poj3107.cpp
*********************************************** */
#include <iostream>
#include <cstring>
#include <deque>
#include <cmath>
#include <queue>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <string>
#include <vector>
#include <cstdio>
#include <bitset>
#include <algorithm>
using namespace std;
#define Debug(x) cout << #x << " " << x <<endl
#define Memset(x, a) memset(x, a, sizeof(x))
const int INF = 0x3f3f3f3f;
typedef long long LL;
typedef pair<int, int> P;
#define FOR(i, a, b) for(int i = a;i < b; i++)
#define MAX_N 50012
int n;
int cnt;
int result;
int head[MAX_N];
int f[MAX_N], dp[MAX_N];
struct edge{
int v;
int next;
}G[2*MAX_N];
void addedge(int u, int v){
G[cnt].v = v;
G[cnt].next = head[u];
head[u] = cnt++;
}
void dfs(int u, int fa){
//f[u] : 节点u的子孙一共有几个
//dp[u] : 把节点u删去,子结点的连通图里最大结点数
//result :删除一个节点之后,让剩下的分支中节点数量最多的尽量少,result存最少的数量
f[u] = 1;
int ans = -INF;
for(int e = head[u]; e != -1; e = G[e].next){
int v = G[e].v;
if(v == fa) continue;
dfs(v, u);
f[u] += f[v];
ans = max(ans, f[v]);
}
dp[u] = max(ans, n - f[u]);
result = min(dp[u], result);
}
int main() {
//freopen("in.cpp", "r", stdin);
//cin.tie(0);
//ios::sync_with_stdio(false);
while(~scanf("%d", &n)){
cnt = 0;
result = INF;
Memset(dp, 0x3f);
Memset(head, -1);
FOR(i, 0, n-1){
int u, v;
scanf("%d%d", &u, &v);
addedge(u, v);
addedge(v, u);
}
dfs(1, -1);
int first = 0;
for(int i = 1; i <= n; i++){
if(dp[i] == result)
if(!first){
printf("%d", i);
first = 1;
}else{
printf(" %d", i);
}
}
printf("\n");
}
return 0;
}