树的重心 poj1655

#include <stdio.h>
#include <iostream>
#include <string.h>
#include <algorithm>
#include <queue>
#include <set>
#include <map>

using namespace std;
#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define DBG printf("this is a input\n")
#define fi first
#define se second
#define mk(a, b) make_pair(a,b)
#define p_queue priority_queue

ll gcd(ll a, ll b) {
    return b == 0 ? a : gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}

int T, n;
int head[20005], vis[20005], cnt;
int size[20005], ans_pos, ans_count;
//size[i]：用来存删除当前节点后，以i为根的子树大小
//ans_pos：记录重心标号
//ans_count：记录删除重心后，最大子树节点数
struct node
{
    int t, next;
}edge[40005];
void add(int f, int t)
{
    edge[cnt].t = t;
    edge[cnt].next = head[f];
    head[f] = cnt ++;
}
void Init()
{
    mem(vis,0);
    mem(head,-1);
    ans_pos = INF;
    cnt = 0;
}
void dfs(int root)
{
    vis[root] = 1;
    size[root] = 1;
    int tree_count = 0;
    for(int i = head[root] ; i != -1 ; i = edge[i].next)
    {
        int v = edge[i].t;
        if(!vis[v])
        {
            dfs(v);
            size[root] += size[v];
            tree_count = max(tree_count,size[v]); //删除root节点后，各子树的大小，取最大
        }
    }
    tree_count = max(tree_count,n-size[root]); //删除该节点后，该节点父亲节点形成的树的大小，取最大值
    if(tree_count <= n/2 && root < ans_pos) { //因为删除重心后，子树的大小一定都小于等于总节点数除以2
        ans_count = tree_count;
        ans_pos = root;
    }
}
int main(void)
{
    scanf("%d",&T);
    while(T --)
    {
        Init();
        scanf("%d",&n);
        for(int i = 1 ; i <= n-1 ; i ++)
        {
            int u, v;
            scanf("%d %d",&u, &v);
            add(u,v);
            add(v,u);
        }
        dfs(1);
        printf("%d %d\n",ans_pos,ans_count);
    }
}