POJ 3140 Contestants Division(树形DP)
2016-04-04 19:58
302 查看
题意:给一颗无向树,问删除某一条边后两个连通分支的最小差异值
思路:也是和前几题差不多的思路..直接DFS一波就可以了...
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 s, t, and describes a communication line connecting university s and universityt. 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
Sample Output
思路:也是和前几题差不多的思路..直接DFS一波就可以了...
#include <cstdio> #include <queue> #include <cstring> #include <iostream> #include <cstdlib> #include <algorithm> #include <vector> #include <map> #include <string> #include <set> #include <ctime> #include <cmath> #include <cctype> #define fab(a) (a)>0?(a):0-(a) using namespace std; #define maxn 100005 #define LL long long #define inf 1e14 int cas=1,T; vector<int>e[maxn]; LL a[maxn]; LL dp[maxn]; int n,m; LL minx ; LL sum; void dfs(int u,int fa) { dp[u]=a[u]; for (int i = 0;i<e[u].size();i++) { int v = e[u][i]; if (v==fa) continue; dfs(v,u); dp[u]+=dp[v]; } minx = min(minx,fab(sum-dp[u]-dp[u])); } int main() { while (scanf("%d%d",&n,&m) && n+m) { minx = inf; sum = 0; for (int i = 0;i<=n;i++) e[i].clear(); for (int i = 1;i<=n;i++) scanf("%lld",&a[i]),sum+=a[i]; for (int i = 1;i<n;i++) { int u,v; scanf("%d%d",&u,&v); e[u].push_back(v); e[v].push_back(u); } memset(dp,0,sizeof(dp)); dfs(1,-1); printf("Case %d: %lld\n",cas++,minx); } //freopen("in","r",stdin); //scanf("%d",&T); //printf("time=%.3lf",(double)clock()/CLOCKS_PER_SEC); return 0; }
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 s, t, and describes a communication line connecting university s and universityt. 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
相关文章推荐
- 与调试器共舞 - LLDB 的华尔兹
- 数据库系统概念学习01
- nginx rewrite重写
- Java进阶02 异常处理
- 深入理解二叉搜索树(BST)
- 利用gson处理Java反射TypeToken泛型运行时类型擦除
- Android webview 完美浏览器解决方案 webview
- matlab实现图像四点投影变换
- Swift NSDate的一个分类,把"Mon Apr 04 19:45:37 +0800 2016"这种格式的时间转换为"2016-04-04 11:45:37 +0000"
- 5.价值观作业
- msysgit 上传文件夹,规范化的日常
- Linux上的防病毒软件ClamAV
- Android - ★知识点
- SwipeRefreshLayout google自带下拉刷新
- Maven+Spring+Spring MVC+MyBatis+MySQL,搭建SSM框架环境
- git的常用命令,先保存下来
- Gevent协程
- <Android>关于EditText中setInputType和setSingleLine的冲突
- maven搭建多模块项目
- 2016.4.3 腾讯实习生笔试编程题解