Contestant Division(树形dp)
来源:互联网 发布:putty阿里云服务器 编辑:程序博客网 时间:2024/06/01 09:22
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 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
做法就是把以x为根的学生总数求出来再用总量减去它就是另一个区域的学生量了
比较坑的是。。。const ll inf= 0x7fffffff3fffffff;
wa了好几次才发现是这里啊!
#include <iostream>#include <cstdio>#include <cmath>#include <cstring>#include <algorithm>#include <vector>#define maxn 100010#define maxe 2000010using namespace std;typedef long long ll;int n;int ca=1;ll tree[maxn];ll sum;ll d[maxn];int head[maxe];int pre[maxn];ll cnt=0;const ll inf=0x7fffffff3fffffff;int m;ll ans=inf;const int mod = 1e9+7;struct Node{ int to,next;}e[maxe];void add(ll a,ll b){ e[cnt].to=b; e[cnt].next=head[a]; head[a]=cnt++;}void init(){ memset(tree,0,sizeof(tree)); memset(head,-1,sizeof(head)); cnt=0; sum=0; ans=inf;}void getnum(ll x,ll fx){ tree[x]=d[x]; for(int i=head[x];i!=-1;i=e[i].next) { int cur=e[i].to; if(cur==fx)continue; getnum(cur,x); tree[x]+=tree[cur]; } ll t=sum-2*tree[x]; ll dif=t>0?t:(-t); if(ans>dif)ans=dif;}void solve(){ getnum(1,-1); printf("Case %d: %I64d\n",ca++,ans);}int main(){ int t; while(scanf("%d%d",&n,&m)!=EOF) { if(n==0&&m==0)break; init(); ll a,b; for(int i=1;i<=n;i++){scanf("%I64d",&d[i]);sum+=d[i];} for(int i=0;i<m;i++) { scanf("%I64d%I64d",&a,&b); add(a,b); add(b,a); } solve(); } return 0;}
- Contestant Division(树形dp)
- POJ3140 Contestants Division(树形DP)
- poj3140 Contestants Division(树形DP)
- Contestants Division (树形dp)
- Contestants Division - POJ 3140 树形dp
- poj 3140 Contestants Division(树形dp)
- POJ 3140 Contestants Division(树形DP)
- poj3140--Contestants Division(树形dp-水题)
- poj 3140 Contestants Division (树形dp)
- poj3140 Contestants Division(树形dp)
- POJ 3104 Contestants Division 删边类树形dp
- POJ 3140 Contestants Division(树形DP)
- [poj 3140] Contestants Division 树形DP
- POJ 3140 Contestants Division 简单树形DP
- poj_3140 Contestants Division(树形dp)
- POJ 3140 Contestants Division 树形dp
- 【POJ】3140 Contestants Division 树形dp
- Contestants Division(树形dp+删边)
- yx: SpringBoot发送邮件功能
- 欢迎使用CSDN-markdown编辑器
- Android夜间模式的实现方案
- 加速子空间迭代法(Accelerated Subspace Iteration)求特征值问题matlab程序
- linux性能概述
- Contestant Division(树形dp)
- JVM内存垃圾回收机制
- 初入Java 先规范
- java学习中关于异常
- Linux SSL
- 哈夫曼树及哈夫曼编码
- vim 跳到指定行
- web前端学习--用js实现计算器、迷宫、打地鼠
- JAVA面试中问及HIBERNATE与 MYBATIS的对比,在这里做一下总结