Big Event in HDU
来源:互联网 发布:js获取数字前两位 编辑:程序博客网 时间:2024/05/22 22:56
Big Event in HDU
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思路分析:先计算物品的总价值sum1,sum=sum1/2为背包的容量,动态转移方程为dp[i]=max(dp[k],dp[k-v[i]]+v[i])。代码参考:#include <iostream>#include<stdio.h>#include<stdlib.h>#include<string.h>#include<math.h>#include<algorithm>#include<queue>using namespace std;int v[1005],m[1005],dp[250005];int main(){ int N; while(~scanf("%d",&N)) { if(N<0) break; int i,j,k,sum,sum1=0; for(i=0;i<N;i++) { scanf("%d%d",&v[i],&m[i]); sum1+=v[i]*m[i]; } sum=sum1/2; memset(dp,0,sizeof(dp)); for(i=0;i<N;i++) for(j=0;j<m[i];j++) for(k=sum;k>=v[i];k--) if(dp[k]<dp[k-v[i]]+v[i]) dp[k]=dp[k-v[i]]+v[i]; printf("%d %d\n",sum1-dp[sum],dp[sum]); } return 0;}
阅读全文
0 0
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU *
- c# bitmap和base64编码相互转换
- mahout实现的算法集
- PHP面向对象的构造、析构函数
- HDFS文件系统的基本操作 Hadoop权威指南
- Linux命令学习总结: file命令
- Big Event in HDU
- Java 中文字符判断
- 关于VC在64位系统下读取注册表启动项时遇见的读取的数据与实际不一致的问题
- Python中字符串的大小写合集
- 关于一维数组
- 基于Opencv3.0对图像进行透视变换
- 无人商店是“风口”吗? 风险与机遇并存!
- 【MVC】发布问题0x80070021与0x8007000d,解决方案
- hiho一下 第158周 非法二进制数 (dp)