hdu 2191 珍惜现在，感恩生活

链接:http://acm.split.hdu.edu.cn/showproblem.php?pid=2191

思路：多重背包模板题

 #include <stdio.h>
 #include <stdlib.h>
 #include <string.h>
 #include <math.h>
 #include <algorithm>
 using namespace std;
 int money,type;
 int price[],weigh[],num[],dp[];
 int max(int a,int b)
 {
      return a>b?a:b;
 }
 void CompletePack(int price,int weigh)
 {
      for(int i=price;i<=money;i++)
          dp[i]=max(dp[i],dp[i-price]+weigh);
 }
 void ZeroOnePack(int price,int weigh)
 {
      for(int i=money;i>=price;i--)
          dp[i]=max(dp[i],dp[i-price]+weigh);
 }
 void MultiplePack(int price,int weigh,int num)
 {
      if(price*num>=money)
           CompletePack(price,weigh);
      int k=;
      while(k<num)
      {
           ZeroOnePack(k*price,k*weigh);
           num-=k;
           k>>;
      }
      ZeroOnePack(num*price,num*weigh);
 }
 int main()
 {
      int t;
      scanf("%d",&t);
      while(t--)
      {
           scanf("%d %d",&money,&type);
           memset(dp,,sizeof(dp));
           for(int i=;i<=type;i++)
           {
                scanf("%d %d %d",&price[i],&weigh[i],&num[i]);
                MultiplePack(price[i],weigh[i],num[i]);
           }
           printf("%d\n",dp[money]);
      }
      return ;
 }