Hdu 1171 Big Event in HDU(背包)
题目链接: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).
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.
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:
2
10 1
20 1
3
10 1
20 2
30 1
-1
Sample Output:
20 10
40 40
解题思路:这道题虽然是道多重背包题,但是可以转化为01背包处理,因为退出条件错了几次…退出条件是负数就退出,这个是要注意的。
代码如下:
#include <bits/stdc++.h>
using namespace std;
#define N 5005
#define inf 0x3f3f3f3f
typedef long long ll;
int n,dp[N*55],w[N];
int main(){
while(scanf("%d",&n)!=EOF){
if(n<0)break;//注意是负数就退出,不是等于-1
int cnt=0,sum=0;
for(int i=0;i<n;i++){
int a,b;
scanf("%d %d",&a,&b);
sum+=a*b;
for(int j=0;j<b;j++){
w[cnt++]=a;
}
}
int m=sum;
sum/=2;
memset(dp,0,sizeof(dp));
for(int i=0;i<cnt;i++){
for(int j=sum;j>=w[i];j--){
dp[j]=max(dp[j],dp[j-w[i]]+w[i]);
}
}
printf("%d %d\n",m-dp[sum],dp[sum]);
}
return 0;
}