POJ 3140.Contestants Division 基础树形dp

Contestants Division

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 10704		Accepted: 3004

Description

In the new ACM-ICPC Regional Contest, a special monitoring and submitting system will be set up, and students will be able to compete at their own universities. However there’s one problem. Due to the high cost of the new judging system, the organizing committee can only afford to set the system up such that there will be only one way to transfer information from one university to another without passing the same university twice. The contestants will be divided into two connected regions, and the difference between the total numbers of students from two regions should be minimized. Can you help the juries to find the minimum difference?

Input

There are multiple test cases in the input file. Each test case starts with two integers N and M, (1 ≤ N ≤ 100000, 1 ≤ M ≤ 1000000), the number of universities and the number of direct communication line set up by the committee, respectively. Universities are numbered from 1 to N. The next line has N integers, the K^th integer is equal to the number of students in university numbered K. The number of students in any university does not exceed 100000000. Each of the following M lines has two integers s, t, and describes a communication line connecting university s and university t. All communication lines of this new system are bidirectional.

N = 0, M = 0 indicates the end of input and should not be processed by your program.

Output

For every test case, output one integer, the minimum absolute difference of students between two regions in the format as indicated in the sample output.

Sample Input

7 6
1 1 1 1 1 1 1
1 2
2 7
3 7
4 6
6 2
5 7
0 0

Sample Output

Case 1: 1

Source

Shanghai 2006

 

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

题意：删除一棵树上的一条边，使得形成的两棵树的权值差最小

思路：树形dp

代码：

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<queue>
#include<stack>
#include<map>
#include<stack>
#include<set>
#include<bitset>
using namespace std;
#define PI acos(-1.0)
#define eps 1e-8
typedef long long ll;
typedef pair<int,int > P;
const int N=2e5+,M=2e6+;
const int inf=0x3f3f3f3f;
const ll INF=1e18+,mod=1e9+;
struct edge
{
    int from,to;
    int next;
};
edge es[M];
int cnt,head[N];
ll sum,ans;
ll w[N],deep[N];
void init()
{
    cnt=;
    memset(head,-,sizeof(head));
}
void addedge(int u,int v)
{
    cnt++;
    es[cnt].from=u,es[cnt].to=v;
    es[cnt].next=head[u];
    head[u]=cnt;
}
void dfs(int u,int fa)
{
    deep[u]=w[u];
    for(int i=head[u];i!=-;i=es[i].next)
    {
        int v=es[i].to;
        if(v==fa) continue;
        dfs(v,u);
        deep[u]+=deep[v];
    }
    if(sum>=*deep[u]) ans=min(ans,sum-*deep[u]);
    else ans=min(ans,*deep[u]-sum);
}
int main()
{
    int Case=,n,m;
    while(~scanf("%d%d",&n,&m))
    {
        if(n==&&m==) break;
        init();
        sum=,ans=INF;
        for(int i=;i<=n;i++) scanf("%lld",&w[i]),sum+=w[i];
        for(int i=;i<=m;i++)
        {
            int u,v;
            scanf("%d%d",&u,&v);
            addedge(u,v),addedge(v,u);
        }
        memset(deep,0LL,sizeof(deep));
        dfs(,);
        printf("Case %d: %lld\n",++Case,ans);
    }
    return ;
}

树形dp