树的重心

http://poj.org/problem?id=1655

<pre name="code" class="cpp">#include<map>
#include<string>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<queue>
#include<vector>
#include<iostream>
#include<algorithm>
#include<bitset>
#include<climits>
#include<list>
#include<iomanip>
#include<stack>
#include<set>
#define clr(a,b) memset(a,b,sizeof(a))
using namespace std;
typedef long long ll;
const int MAXN = 20010;
int cnt = 0;
int head[MAXN*2];
int dp[MAXN];
int num[MAXN];
int n;

void init()
{
    clr(head,-1);
    cnt = 0;
}

struct edge
{
    int to;
    int next;
}e[MAXN*2];

void addedge(int u,int v)
{
    e[cnt].to = v;
    e[cnt].next = head[u];
    head[u] = cnt++;
}

void dfs(int u,int pre)
{
    dp[u] = 0;
    num[u] = 1;
    for(int i = head[u]; i!=-1; i = e[i].next)
    {
        int v = e[i].to;
        if(v==pre) continue;
        dfs(v,u);
        dp[u] = max(dp[u],num[v]);
        num[u] += num[v];
    }
    dp[u] = max(dp[u],n - num[u]);
}

int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d",&n);
        init();
        int a,b;
        for(int i =1; i <= n-1; i++)
        {
            scanf("%d%d",&a,&b);
            addedge(a,b);
            addedge(b,a);
        }
        dfs(1,-1);
        int ans = dp[1];
        int id = 1;
        for(int i =2; i <= n; i++)
        {
            if(dp[i] < ans)
            {
                ans = dp[i];
                id = i;
            }
        }
        printf("%d %d\n",id,ans);
    }
}