Big Event in HDU
Problem Description
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
A test case starting with a negative integer terminates input and this test case is not to be processed.
Output
Sample Input
2 10 1 20 1 3 10 1 20 2 30 1 -1
Sample Output
20 10 40 40
这题是一个典型的背包问题,这里的背包最大容积为w[i](1<=i<=n)的一半。而背包所能取的最大物品数为
n[i](1<=i<=n)的一半。
#include<iostream>
using namespace std;
int main()
{
static bool b[2500001];
static int q[2500001];
int n,p[55],w[55],sum,i,j,k,max,min,num,s;
while(cin>>n&&n>=0)
{
sum=0;
num=0;
for(i=1;i<=n;i++)
{
cin>>p[i]>>w[i];
sum+=p[i]*w[i];
num+=w[i];
}
s=sum;
sum=sum/2;
num=num/2;
memset(b,false,sizeof(b));
b[0]=true;
q[0]=0;
for(i=1;i<=n;i++)
for(k=1;k<=w[i];k++)
for(j=sum;j>=0;j--)
{
if(b[j]&&j+p[i]<=sum&&q[j]<num)
{
b[j+p[i]]=true;
q[j+p[i]]=q[j]+1;
}
}
for(i=sum;i>=0;i--)
if(b[i]==true)
break;
if(s-i>i)
{
max=s-i;
min=i;
}
else
{
max=i;
min=s-i;
}
printf("%d %d/n",max,min);
}
return 0;
}