poj 1655 树的重心

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<vector>
using namespace std;
const int maxn = 20000;
vector<int> tree[maxn + 5];
int d[maxn + 5]; // d[i]表示以i为根的子树的节点个数
#define INF 10000000
int minNode;
int minBalance;
int N;
void dfs(int node, int parent)
{
    d[node] = 1;
    int maxSubTree = 0;
    for (int i = 0; i < tree[node].size(); i++) {
        int son = tree[node][i];
        if (son != parent) {
            dfs(son, node);
            d[node] += d[son];
            maxSubTree = max(maxSubTree, d[son]);
        }
    }
    maxSubTree = max(maxSubTree, N - d[node]);
    if (maxSubTree < minBalance){
        minBalance = maxSubTree;
        minNode = node;
    }
}
int main()
{
    int t;
    scanf("%d", &t);
    while (t--){
        scanf("%d", &N);
        for (int i = 1; i <= N; i++){
            tree[i].clear();
        }
        for (int i = 1; i <= N-1; i++){
            int u, v;
            scanf("%d%d", &u, &v);
            tree[u].push_back(v);
            tree[v].push_back(u);
        }
        minNode = 0;
        minBalance = INF;
        dfs(1, 0); 
        printf("%d %d\n", minNode, minBalance);
    }
    return 0;
}