POJ 2378 Tree Cutting【树的重心】

Tree Cutting

题意： 求树的重心。

题解： 模板题，略。

#include<iostream>
#include<algorithm>
#include<cstring>
#include<vector>
using namespace std;
const int maxn = 1e4 + 10;

int n;
int sz[maxn];
int dp[maxn];
vector<int> out;

int cnt, head[maxn];
struct edge { 
	int v, next;
	edge () {}
	edge (int v, int next) : v(v), next(next) {}
} e[maxn << 1];

void add (int u, int v) {
	e[++cnt] = edge(v, head[u]); head[u] = cnt;
	e[++cnt] = edge(u, head[v]); head[v] = cnt;
}

void DFS (int u, int fa) {
	sz[u] = 1;
	for (int i = head[u]; i; i = e[i].next) {
		int v = e[i].v;
		if (v == fa) continue;
		DFS(v, u);
		sz[u] += sz[v];
		dp[u] = max(dp[u], sz[v]);
	}
	dp[u] = max(dp[u], n - sz[u]);
	if (dp[u] * 2 <= n) out.push_back(u);
}

void run () {
	cnt = 0; out.clear();
	memset(sz, 0, sizeof sz);
	memset(dp, 0, sizeof dp);
	memset(head, 0, sizeof head);
	for (int i = 1, u, v; i < n; ++i) {
		scanf("%d%d", &u, &v);
		add(u, v);
	}
	DFS(1, 0);
	if (out.empty()) printf("NONE\n");
	else {
		sort(out.begin(), out.end());
		for (int i = 0; i < out.size(); ++i) printf("%d\n", out[i]);
	}
}

int main () {
	while (~scanf("%d", &n)) run();	
	return 0;
}