poj 3140

给一棵树（题目明确没说），求删一个点后连通分量之差最小，
树形dp
d[i]表示以i为根节点的树的和，则删除该节点后的差就是 |sum - 2*d[i]|
注意 long long 取绝对值是llabs

#include <cstdio>
#include <algorithm>
#include <cstring>

using namespace std;
const int N = 1000000 + 10;
typedef long long LL;
int n,m,cnt[N],tot,u,v,cas;
int h[N],to[N<<1],net[N<<1];
LL sum,ans,d[N];
void add(int u,int v){
	to[++tot] = v;
	net[tot] = h[u];
	h[u] = tot;
}
int dfs(int u,int fa){
	d[u] = cnt[u];
	for(int i = h[u];i;i = net[i]){
		int v = to[i];
		if(v == fa) continue;
		dfs(v,u);
		d[u] += d[v]; 
	}
}

int main(){
	while(scanf("%d%d",&n,&m) && m + n){
		memset(h,0,sizeof(h));
		tot = 0;
		ans = 2e18;
		sum = 0;
		for(int i = 1;i<=n;i++) {
			scanf("%d",cnt+i); 
			sum += cnt[i];
		}
		for(int i = 0;i<m;i++){
			scanf("%d%d",&u,&v);
			add(u,v);
			add(v,u);
		}
		dfs(1,-1);
		for(int i = 1;i<=n;i++) 
			ans = min(ans,llabs((sum - 2*d[i])));
		printf("Case %d: %lld\n",++cas,ans);
	}
	return 0 ;
}