树的重心

树的重心定义为:找到一个点,其所有的子树中最大的子树节点数最少,那么这个点就是这棵树的重心,删去重

心后，生成的多棵树尽可能平衡.

poj 3107

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#define Max 50010
using namespace std;

int n;
int Start[Max], Next[Max * 2], End[Max * 2];
int dex;
int son[Max];
int ans;
vector <int> V;

void Init() {
	memset(Start, 0, sizeof(Start));
	dex = 0;
	ans = Max;
	V.clear();
}

void BuildG(int a, int b) {
	Next[++dex] = Start[a];
	Start[a] = dex;
	End[dex] = b;
}

void dfs(int v, int fa) {
	son[v] = 0;
	int tmp, maxn = 0;
	for(int i = Start[v]; i; i = Next[i]) {
		int to = End[i];
		if(to != fa) {
			dfs(to, v);
			tmp = son[to] + 1;
			maxn = max(maxn, tmp);
			son[v] += son[to] + 1;
		}
	}
	maxn = max(maxn, n - 1 - son[v]);
	if(maxn < ans)
		ans = maxn, V.clear();
	if(maxn == ans)
		V.push_back(v);
}

int main() {
	while(~scanf("%d", &n)) {
		Init();
		int a, b;
		for(int i = 1; i < n; i++) {
			scanf("%d%d", &a, &b);
			BuildG(a, b);
			BuildG(b, a);
		}
		dfs(1, -1);
		sort(V.begin(), V.end());
		for(int i = 0; i < V.size(); i++) {
			printf("%d", V[i]);
			if(i < V.size() - 1)
				printf(" ");
		}
		printf("\n");
	}
	return 0;
}

poj 1655

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define Max 20010
using namespace std;

int n;
int Start[Max], Next[Max * 2], End[Max * 2];
int dex;
int son[Max];
int ans, ansid;

void Init() {
	memset(Start, 0, sizeof(Start));
	dex = 0;
	ans = Max;
}

void BuildG(int a, int b) {
	Next[++dex] = Start[a];
	Start[a] = dex;
	End[dex] = b;
}

void dfs(int v, int fa) {
	son[v] = 0;
	int tmp, maxn = 0;
	for(int i = Start[v]; i; i = Next[i]) {
		int to = End[i];
		if(to != fa) {
			dfs(to, v);
			tmp = son[to] + 1;
			maxn = max(maxn, tmp);
			son[v] += son[to] + 1;
		}
	}
	maxn = max(maxn, n - 1 - son[v]);
	if(maxn < ans || maxn == ans && v < ansid)
		ansid = v, ans = maxn;
}

int main() {
	int t;
	scanf("%d", &t);
	while(t--) {
		Init();
		scanf("%d", &n);
		int a, b;
		for(int i = 1; i < n; i++) {
			scanf("%d%d", &a, &b);
			BuildG(a, b);
			BuildG(b, a);
		}
		dfs(1, -1);
		printf("%d %d\n", ansid, ans);
	}
	return 0;
}