题目我就不贴了,全是英文,我还是自己简单翻译下吧
温酒描述:就是每一行输入六个数,分别表示第i个的数目,每个的花费和体重由i决定;两人要求价值等价,如果所求的价值的一半为奇数,那就不可能等价;
这是个混合背包问题,包含了01背包,多重背包,以及完全背包问题,
但是了解了题目意思还是可以写的
这里写代码片
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#define MAX 60005
using namespace std;
int sum;
int a[7];
int pack[MAX];
void zeroonepack(int cost,int weight)
{
for(int i=sum; i>=cost; --i)
pack[i]=max(pack[i],pack[i-cost]+weight);
}
void manypack(int cost,int weight)
{
for(int i=cost; i<=sum; ++i)
pack[i]=max(pack[i],pack[i-cost]+weight);
}
void multpack(int cost,int weight,int num)
{
if(cost*num>=sum)
{
manypack(cost,weight);
return ;
}
else
{
int k=1;
while(k<num)
{
zeroonepack(k*cost,k*weight);
num-=k;
k*=2;
}
zeroonepack(num*cost,num*weight);
}
}
int main()
{
int t=0;
while(1)
{
sum=0;
for(int i=1; i<=6; i++)
{
cin>>a[i];
sum+=a[i]*i;
}
if(!sum)
break;
t++;
printf("Collection #%d:\n",t);
if(sum%2)
cout<<"Can't be divided."<<endl;
else
{
sum/=2;
memset(pack,0,sizeof(pack));
for(int i=1; i<=6; i++)
{
if(a[i])
multpack(i,i,a[i]);
}
if(sum==pack[sum])
cout<<"Can be divided."<<endl;
else
cout<<"Can't be divided."<<endl;
}
cout<<endl;
}
}
如果有什么错误,请提醒我哈!