HDU 1171 背包
2015-07-15 14:30
190 查看
Big Event in HDU
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 28020 Accepted Submission(s): 9864
[align=left]Problem Description[/align]
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).
[align=left]Input[/align]
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.
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
2
10 1
20 1
3
10 1
20 2
30 1
-1
[align=left]Sample Output[/align]
20 10
40 40
[align=left]Author[/align]
lcy
题目意思:
给n不同种类的物品,每种物品有自己的价值w[i]和个数num[i],现把全部物品分为两部分,使得两部分总价值最接近,输出两部分总价值。
思路:
物品总价值为sum,那么每部分的总价值最接近sum/2。设一个体积为sum/2的背包,那么问题就转化为选择一些物品使得sum/2的背包中装最大价值的物品,01背包模型。
代码:
#include <cstdio> #include <cstring> #include <algorithm> #include <iostream> #include <vector> #include <queue> #include <cmath> #include <set> using namespace std; #define N 55*50*100/2 int max(int x,int y){return x>y?x:y;} int min(int x,int y){return x<y?x:y;} int abs(int x,int y){return x<0?-x:x;} int n; int v[55], num[55]; int dp ; main() { int i, j, k; while(scanf("%d",&n)==1&&n>=0){ int sum=0; for(i=1;i<=n;i++){ scanf("%d %d",&v[i],&num[i]); sum+=v[i]*num[i]; } memset(dp,0,sizeof(dp)); for(i=1;i<=n;i++){ for(k=0;k<=num[i];k++){ for(j=sum/2;j>=k*v[i];j--){ dp[j]=max(dp[j],dp[j-v[i]*k]+v[i]*k); } } } printf("%d %d\n",sum-dp[sum/2],dp[sum/2]); } }
相关文章推荐
- .Net学习笔记----2015-07-15(简单的布局)
- 关于get请求乱码而post方式不会乱码详解
- Java中Comparable和Comparator实现对象比较
- JAVA多线程Thread和Runnable的实现
- 正交投影变换与透视投影
- leetCode 63.Unique Paths II (唯一路径II) 解题思路和方法
- HDU-1331-Function Run Fun(动态规划3)
- Excel插入图片
- MongoDB 我的学习笔记
- container_of的使用
- 新人,小搭建NFS协议
- opencv从摄像头读写视频文件
- Tomcat控制台窗口鼠标滚动和日志转存为文件
- 浅谈命令查询职责分离(CQRS)模式
- GRE写作必备句型
- Windows Server 2008 R2修改远程桌面连接数
- 排序----快排C++实现
- Terminal 命令
- java向多线程中传递参数的三种方法详细介绍
- 面试,一个不对等的双选之路