HDU2191 悼念512汶川大地震遇难同胞——珍惜现在，感恩生活

标准的多重背包应用,只要 看了 背包九讲应该就会做了的题目;

用结构体做比较省事;

这题比较蛋疼的是 中间把 数量打成重量,找了半天也找不出来,又看了几遍PO3还是没找出来...抱着奇怪的心里,搜了一下.我去...

唉..以后要好好注意写代码的习惯了...

#include<iostream>
#define maxn 105
#define max(a,b) (a>b?a:b)
int dp[maxn];
int n,m,t;
struct node
{
    int amount,weight,price;
}game[maxn];
void zeroOnePack(int cost,int weight)
{
    for(int i=n;i>=cost;i--)
        dp[i]=max(dp[i],dp[i-cost]+weight);
}
void completePack(int cost ,int weight)
{
    for(int i=cost;i<=n;i++)
        dp[i]=max(dp[i],dp[i-cost]+weight);
}
void multiPack(int cost,int weight,int amount)
{
    
      if(cost * amount >= n)
        completePack(cost,weight);
     else
    {
        int k=1;
        while( k< amount)
        {
            zeroOnePack(k*cost,k*weight);
            amount-=k;
            k*=2;
        }
        zeroOnePack(amount*cost,amount*weight);
     }
}

int main()
{
    //freopen("2191.txt","r",stdin);
    int i,j;
    while(~scanf("%d",&t))
    {
        while(t--)
        {
            memset(dp,0,sizeof(dp));
            memset(game,0,sizeof(game));
            scanf("%d %d" ,&n,&m);
                for(i=0;i<m;i++)
                    scanf("%d %d %d",&game[i].price,&game[i].weight,&game[i].amount);
             for(i=0;i<m;i++)
                multiPack(game[i].price,game[i].weight,game[i].amount);
             printf("%d
",dp[n]);
        }
    }
    return 0;
}