hdu1171 Big Event in HDU 01-背包
来源:互联网 发布:宿迁宽带测速软件 编辑:程序博客网 时间:2024/04/28 19:25
转载请注明出处:http://blog.csdn.net/u012860063
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1171
Problem Description
Nowadays, we all know that Computer College is the biggest department in HDU. But, maybe you don't know that Computer College had ever been split into Computer College and Software College in 2002.
The splitting is absolutely a big event in HDU! At the same time, it is a trouble thing too. All facilities must go halves. First, all facilities are assessed, and two facilities are thought to be same if they have the same value. It is assumed that there is N (0<N<1000) kinds of facilities (different value, different kinds).
The splitting is absolutely a big event in HDU! At the same time, it is a trouble thing too. All facilities must go halves. First, all facilities are assessed, and two facilities are thought to be same if they have the same value. It is assumed that there is N (0<N<1000) kinds of facilities (different value, different kinds).
Input
Input contains multiple test cases. Each test case starts with a number N (0 < N <= 50 -- the total number of different facilities). The next N lines contain an integer V (0<V<=50 --value of facility) and an integer M (0<M<=100 --corresponding number of the facilities) each. You can assume that all V are different.
A test case starting with a negative integer terminates input and this test case is not to be processed.
A test case starting with a negative integer terminates input and this test case is not to be processed.
Output
For each case, print one line containing two integers A and B which denote the value of Computer College and Software College will get respectively. A and B should be as equal as possible. At the same time, you should guarantee that A is not less than B.
Sample Input
210 120 1310 1 20 230 1-1
Sample Output
20 1040 40
转换为01-背包问题求解:
代码如下:
#include <cstdio>#include <cstring>#define N 200047int f[N],val[N];int max(int a,int b){if(a > b)return a;else return b;}int main(){int t,n,i,j,k,l,sum,x,y;while(scanf("%d",&n) && n>0 ){memset(val,0,sizeof(val));memset(f,0,sizeof(f));sum = 0;l = 0;for(i = 0 ; i < n ; i++){scanf("%d%d",&x,&y);for(int p=0 ; p<y ; p++)//将价值存入数组{val[l++] = x;sum+=x;}}for(i = 0 ; i < l ; i++)//01背包{for(j = sum/2 ; j >= val[i]; j--){f[j] = max(f[j],f[j-val[i]]+val[i]);}}printf("%d %d\n",sum-f[sum/2],f[sum/2]);}return 0;}
3 0
- HDU1171:Big Event in HDU(01背包)
- hdu1171 Big Event in HDU 01-背包
- hdu1171 Big Event in HDU 01背包
- hdu1171 Big Event in HDU --01背包
- HDU1171:Big Event in HDU(01背包)
- HDU1171--Big Event in HDU--01背包,多重背包
- Big Event in HDU hdu1171 多重背包
- HDU1171:Big Event in HDU(多重背包)
- hdu1171 Big Event in HDU (多重背包)
- hdu1171---Big Event in HDU(多重背包)
- hdu1171 Big Event in HDU (多重背包)
- hdu1171 Big Event in HDU (01背包变形)
- hdu1171 Big Event in HDU(01背包)
- HDU1171 Big Event in HDU
- HDU1171--Big Event in HDU
- HDU1171 Big Event in HDU
- HDU1171 Big Event in HDU
- hdu1171 Big Event in HDU
- TStringlist自定义排序
- 转发和重定向
- UIView之ContentMode基础
- 大数据时代(三)大数据的隐患
- 除去Scala的糖衣(13) -- Default Parameter Value
- hdu1171 Big Event in HDU 01-背包
- 比赛现场气氛营造问题II
- java中vector的详细用法
- 综合作业:图书管理系统
- M2Eclipse:Maven Eclipse插件无法搜索远程库的解决方法
- /boot/grub/menu.lst 配置档
- tomcat 日志维护
- mysql添加字段
- 关于对Fragment事务操作对比物理键导航操作的困惑的解惑