HDU 1059 dividing 多重揹包

多重揹包模板題。

#include<iostream>
#include<cstdio>
#include<string.h>
#include<algorithm>
#include<cmath>
using namespace std;

int sum,f[200005],a[10];

void zerone(int cost)
{
    for (int i=sum; i>=cost; i--)
    {
        f[i]=max(f[i],f[i-cost]+cost);
    }
}

void complete(int cost)
{
    for (int i=cost; i<=sum; i++)
        f[i]=max(f[i],f[i-cost]+cost);
}

void multi(int cost,int amount)
{
    //cout<<"cost="<<cost<<" amount="<<amount<<endl;
    if (cost*amount>=sum)
    {
        complete(cost);
        //cout<<"1:f="<<f[sum]<<endl;
    }else
    {
        int k=1;
        while (k<amount)
        {
            zerone(k*cost);
            amount-=k;
            k*=2;
        }
        zerone(amount*cost);
        //cout<<"2:f="<<f[sum]<<endl;
    }
}

int main()
{
    int cas=0;
    while (cin>>a[1]>>a[2]>>a[3]>>a[4]>>a[5]>>a[6])
    {
        cas++;
        sum=0;
        if (a[1]+a[2]+a[3]+a[4]+a[5]+a[6]==0) break;
        memset(f,0,sizeof(f));
        for (int i=1; i<=6; i++)
        {
            sum+=i*a[i];
        }
        printf("Collection #%d:\n",cas);
        if (sum%2)
        {
            printf("Can't be divided.\n");
			printf("\n");
			continue;
        }
        sum/=2;
        for (int i=1; i<=6; i++)
            multi(i,a[i]);
        if(f[sum]==sum){
			printf("Can be divided.\n");
		}
		else printf("Can't be divided.\n");
		printf("\n");
    }
    return 0;
}