POJ 3140 Contestants Division【树形DP】

Contestants Division

题意： 一棵有点权的树，求删除某条边之后，两棵子树的权值差最小。

题解： 虽然题目没有很直白地说是一棵树 但是由题意可得确实是一棵树。随便找一点开始DFS，记录以每个节点为根的子树的权值和dp[i]。然后找到最小的sum - dp[i] - dp[i]即可。

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
#define fab(a) (a) > 0 ? (a) : 0-(a)
typedef long long ll;
const int maxn = 1e5 + 10;
const ll INF = 0x3f3f3f3f3f3f3f3f;

int n, m, cas;
ll ans, sum;
ll dp[maxn];

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) {
	for (int i = head[u]; i; i = e[i].next) {
		int v = e[i].v;
		if (v == fa) continue;
		DFS(v, u);
		dp[u] += dp[v];
	}
	ans = min(ans, fab(sum - dp[u] - dp[u]));
}

void run () {
	ans = INF;
	cnt = sum = 0;
	memset(dp, 0, sizeof dp);
	memset(head, 0, sizeof head);
	for (int i = 1; i <= n; ++i) {
		scanf("%lld", dp + i);
		sum += dp[i];
	}
	for (int i = 1; i <= m; ++i) {
		int u, v; scanf("%d%d", &u, &v);
		add(u, v);
	}
	DFS(1, 0);
	printf("Case %d: %lld\n", ++cas, ans);
}

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