I - Balancing Act POJ - 1655

Consider a tree T with N (1 <= N <= 20,000) nodes numbered 1...N. Deleting any node from the tree yields a forest: a collection of one or more trees. Define the balance of a node to be the size of the largest tree in the forest T created by deleting that node from T. 
For example, consider the tree: 

Deleting node 4 yields two trees whose member nodes are {5} and {1,2,3,6,7}. The larger of these two trees has five nodes, thus the balance of node 4 is five. Deleting node 1 yields a forest of three trees of equal size: {2,6}, {3,7}, and {4,5}. Each of these trees has two nodes, so the balance of node 1 is two.

For each input tree, calculate the node that has the minimum balance. If multiple nodes have equal balance, output the one with the lowest number.

Input

The first line of input contains a single integer t (1 <= t <= 20), the number of test cases. The first line of each test case contains an integer N (1 <= N <= 20,000), the number of congruence. The next N-1 lines each contains two space-separated node numbers that are the endpoints of an edge in the tree. No edge will be listed twice, and all edges will be listed.

Output

For each test case, print a line containing two integers, the number of the node with minimum balance and the balance of that node.

Sample Input

1
7
2 6
1 2
1 4
4 5
3 7
3 1

Sample Output

1 2
树形DP，注意考虑n-sum[u]这个搜索方向的联通点集

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<sstream>
#include<algorithm>
#include<queue>
#include<deque>
#include<iomanip>
#include<vector>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<fstream>
#include<memory>
#include<list>
#include<string>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
#define MAXN 200099
#define L 31
#define INF 1000000009
#define eps 0.00000001
#define sf(a) scanf("%d",&a)
/*
dp[i] 记录i点除去偶的最大点集点数
sum[i] 记录所有子节点数目
*/
struct edge
{
    int to, next;
}E[MAXN];
int sum[MAXN], dp[MAXN], head[MAXN];
int t, n, cnt;
void addedge(int f,int t)
{
    E[cnt].to = t;
    E[cnt].next = head[f];
    head[f] = cnt++;
}
void init()
{
    memset(sum, , sizeof(sum));
    memset(dp, , sizeof(dp));
    memset(head, -, sizeof(head));
    cnt = ;
}
void dfs(int u, int pre)
{
    sum[u] = dp[u] = ;
    for (int i = head[u]; i != -; i = E[i].next)
    {
        int v = E[i].to;
        if (v == pre) continue;
        dfs(v, u);
        sum[u] += sum[v];
        dp[u] = max(dp[u], sum[v]);
    }
    dp[u] = max(dp[u], n - sum[u]);
}
int main()
{
    sf(t);
    while (t--)
    {
        init();
        sf(n);
        for (int i = ; i < n - ; i++)
        {
            int a, b;
            sf(a), sf(b);
            addedge(a, b);
            addedge(b, a);
        }
        dfs(, -);
        int ans = INF, k = -;
        for (int i = ; i <= n; i++)
        {
            if (dp[i] < ans)
            {
                k = i, ans = dp[i];
            }
        }
        printf("%d %d\n", k, ans);
    }
}