hdu 2191 悼念512汶川大地震遇难同胞——珍惜现在，感恩生活 (多重背包)

#include<algorithm>
#include<cstring>
#include<cstdio>
using namespace std;
int dp[109];
int cost[109];
int value[109];
int country[109];
int volume;
void ZeroOne(int cost,int value)
{
    for(int i=volume;i>=cost;i--)
        dp[i]=max(dp[i],dp[i-cost]+value);
}
void Compelete(int cost,int value)
{
    for(int i=cost;i<=volume;i++)
        dp[i]=max(dp[i],dp[i-cost]+value);
}
void Multiply(int cost,int value,int amount)
{
    if(cost*amount>=volume)
    {
        Compelete(cost,value);
        return;
    }
    for(int k=1;k<=amount;k<<=1)
    {
        ZeroOne(k*cost,k*value);
        amount-=k;
    }
    if(amount)
        ZeroOne(amount*cost,amount*value);
}
int main()
{      int T,n,i;
    scanf("%d",&T);
    while(T--)
    {
        memset(dp,0,sizeof(dp));
        scanf("%d%d",&volume,&n);
        for(i=1;i<=n;i++){scanf("%d%d%d",&cost[i],&value[i],&country[i]);}
        for(i=1;i<=n;i++){Multiply(cost[i],value[i],country[i]);}
        printf("%d\n",dp[volume]);
    }
    return 0;
}