POJ 1655 Balancing Act

题目链接：http://poj.org/problem?id=1655

Balancing Act

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 12278		Accepted: 5202

Description

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

Source

POJ Monthly--2004.05.15 IOI 2003 sample task

思路：一道简单的树形DP题。对于每个节点，只要知道它的所有子节点作为一棵子树的节点数和它自己作为子树的节点数，那么以它为根节点，就可以算出它的平衡度，它的父节点作为子树的节点数可以用总数减掉它作为子树的节点数。详见代码。

附上AC代码：

#include <cstdio>
#include <vector>
#include <algorithm>
//#pragma comment(linker, "/STACK:102400000, 102400000")
using namespace std;
const int maxn = 20005;
int dp[maxn], sizev[maxn];
bool vis[maxn];
vector<int> edge[maxn];
int n;

void init(){
	for (int i=1; i<=n; ++i){
		vis[i] = false;
		edge[i].clear();
	}
}

void add_edge(int a, int b){
	edge[a].push_back(b);
	edge[b].push_back(a);
}

void dfs(int u){
	vis[u] = true;
	dp[u] = 0;
	sizev[u] = 1;
	for (int i=0; i<edge[u].size(); ++i){
		int v = edge[u][i];
		if (vis[v])
			continue;
		dfs(v);
		sizev[u] += sizev[v];
		dp[u] = max(dp[u], sizev[v]);
	}
	dp[u] = max(dp[u], n-sizev[u]);
}

int main(){
	#ifdef LOCAL
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
	#endif
	int T;
	scanf("%d", &T);
	while (T--){
		scanf("%d", &n);
		init();
		int a, b;
		for (int i=1; i<n; ++i){
			scanf("%d%d", &a, &b);
			add_edge(a, b);
		}
		dfs(1);
		int ans=n, res=1;
		for (int i=1; i<=n; ++i)
			if (ans > dp[i]){
				ans = dp[i];
				res = i;
			}
		printf("%d %d\n", res, ans);
	}
	return 0;
}