owadays, 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
题意是给你n种不同得设备,每个设备存在两个属性,一个是value和数量。所以可以用多重背包来写。这时候我们要分析,总的value是什么??根据文中的最后一句话能看出总的value=sum(value*数量)/2。最后A的答案为sum-dp[value]
B的答案就为dp[value];
此处用了多重背包二进制优化
#include<bits/stdc++.h>
using namespace std;
const int N=5e5+10;
int dp[N];
int v[N],cnt[N];
int n;
int main()
{
while(~scanf("%d",&n)&&n>0)
{
memset(dp,0,sizeof(dp));
int sum=0;
for(int i=1;i<=n;i++)
{
cin>>v[i]>>cnt[i];
sum+=v[i]*cnt[i];
}
int res=sum/2;
for(int i=1;i<=n;i++)
{
if(v[i]*cnt[i]>=res)
{
for(int p=v[i];p<=res;p++) dp[p]=max(dp[p],dp[p-v[i]]+v[i]);
}
else
{
int c=cnt[i];
int k=1;
while(k<c)
{
for(int j=res;j>=k*v[i];j--) dp[j]=max(dp[j],dp[j-k*v[i]]+k*v[i]);
c-=k;
k*=2;
}
for(int j=res;j>=c*v[i];j--) dp[j]=max(dp[j],dp[j-c*v[i]]+c*v[i]);
}
}
printf("%d %d\n",sum-dp[res],dp[res]);
}
}