POJ-3140 Contestants Division[树形dp]

Contestants Division

Time Limit: 2000MS

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: 

题意：

给出一棵树，每个节点都有权值，找到一条边把树分成两部分，使得两棵树尽量的平衡，输出最小的差的绝对值。

思路：

很水的题，只要一遍dfs找到这个边就可以了。INF设小了，贡献了无数次WA。

#include "stdio.h"
#include "string.h"
#include "algorithm"
using namespace std;
typedef long long LL;
const LL INF = 21474836470000000;
const int maxn = 1000000 + 10;
struct node {
    int to, next;
};
int N, M;
LL num[maxn];
int head[maxn];
node e[maxn*2];
LL su[maxn];
LL sum;
LL res;
int tot;
LL labs(LL a) {return a<0?-a:a;}
void add_edge(int u, int v) {
    e[tot].to = v; e[tot].next = head[u];
    head[u] = tot++;
}
void dfs(int u, int fa) {
    su[u] = num[u];
    for (int i = head[u]; i != -1; i = e[i].next) {
        int v = e[i].to; 
        if (v == fa) continue; 
        dfs(v, u); su[u] += su[v];
    }
    res = min(res, labs(sum - 2*su[u]));
}
void init() {
    memset(head, -1, sizeof(head));
    tot = 0; res = INF; sum = 0;
}
int main(int argc, char const *argv[])
{
    int Kcase = 0;
    while (scanf("%d%d", &N, &M), M||N) {
        init(); int u, v;
        for (int i = 1; i <= N; i++) scanf("%I64d", num+i), sum += num[i];
        for (int i = 0; i < M; i++) {
            scanf("%d%d", &u, &v);
            add_edge(u, v); add_edge(v, u);
        }
        dfs(1, -1);
        printf("Case %d: %I64d\n", ++Kcase, res);
    }
    return 0;
}

---