• POJ 3104 Contestants Division


    Contestants Division
    Time Limit: 2000MS   Memory Limit: 65536K
    Total Submissions: 10597   Accepted: 2978

    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 Kth 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 st, 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

     
    题目大意:一棵树每个点有权值 求删掉某条边后 形成的两棵子树的权值差的绝对值最小。
     
    题解 dfs
     
    代码
    #include<iostream>
    #include<cstring>
    #include<cstdio>
    #include<cmath>
    #include<algorithm>
    #define maxn 1000005
    using namespace std;
    
    int n,m,x,y,sumedge,kse;
    long long dad[maxn],w[maxn],size[maxn],head[maxn];
    
    struct Edge{
        int x,y,nxt;
        Edge(int x=0,int y=0,int nxt=0):
            x(x),y(y),nxt(nxt){}
    }edge[maxn<<1];
    
    void add(int x,int y){
        edge[++sumedge]=Edge(x,y,head[x]);
        head[x]=sumedge;
    }
    
    void dfs(int x){
        size[x]=w[x];
        for(int i=head[x];i;i=edge[i].nxt){
            int v=edge[i].y;
            if(v==dad[x])continue;
            dad[v]=x;
            dfs(v);
            size[x]+=size[v];
        }
    }
    
    long long gg(long long x){
        if(x<=0)return -x;
        return x;
    }
    
    int main(){
        while(~scanf("%d%d",&n,&m)){
            if(!n&&!m)break;
            memset(head,0,sizeof(head));
            memset(size,0,sizeof(size));
            memset(dad,0,sizeof(dad));
            for(int i=1;i<=n;i++)scanf("%lld",&w[i]);
            if(n==1){printf("0
    ");continue;}
            for(int i=1;i<n;i++)scanf("%d%d",&x,&y),add(x,y),add(y,x);
            dfs(1);
            __int64 ans=1e15;
            for(int i=1;i<=n;i++){
              ans=min(ans,gg(gg(size[1]-size[i])-size[i]));
            }
            printf("Case %d: %I64d
    ",++kse,ans);
        }
        return 0;
    } 
     
  • 相关阅读:
    实验二
    实验一简单的加减乘除
    自我简介
    软件工程——第五次博客作业
    《软件测试》--第四次博客作业
    软件测试 第三次作业
    软件测试 第二次作业
    个人简介
    软件测试 第一次测评
    AE CC 装不上,安装程序检测到计算机重新启动的过程可能暂停。建议退出安装程序,重新启动计算机,然后再重试。
  • 原文地址:https://www.cnblogs.com/zzyh/p/7481353.html
Copyright © 2020-2023  润新知