poj2392 多重背包

 //Accepted    868 KB    188 ms
 //多重背包
 #include <cstdio>
 #include <cstring>
 #include <iostream>
 #include <queue>
 #include <cmath>
 #include <algorithm>
 using namespace std;
 /**
   * This is a documentation comment block
   * 如果有一天你坚持不下去了，就想想你为什么走到这儿！
   * @authr songt
   */
 ;
 ;
 int dp[imax_v];
 int n;
 struct node
 {
     int weight,c,a;
 }f[imax_n];
 //按a排序，考虑我们在dp时采用的是倒推，所以我们需要先计算出a较小的时候的情况
 int cmp(node x,node y)
 {
     return x.a<y.a;
 }
 int max(int a,int b)
 {
     return a>b?a:b;
 }
 void zeroOnePack(int weight,int value,int v)
 {
     for (int j=v;j>=weight;j--)
     {
         dp[j]=max(dp[j],dp[j-weight]+value);
     }
 }
 void completePack(int weight,int value,int v)
 {
     for (int j=weight;j<=v;j++)
     {
         dp[j]=max(dp[j],dp[j-weight]+value);
     }
 }
 void multiplePack(int weight,int value,int amount,int v)
 {
     ;
     if (amount*weight>=v)
     {
         completePack(weight,value,v);
         return ;
     }
     while (k<amount)
     {
         zeroOnePack(k*weight,k*value,v);
         amount-=k;
         k<<=;
     }
     zeroOnePack(amount*weight,amount*value,v);
 }
 void Dp()
 {
     memset(dp,,sizeof(dp));
     ;i<=n;i++)
     {
         multiplePack(f[i].weight,f[i].weight,f[i].c,f[i].a);
     }
     ;
     ;i<=;i++)
     ans=max(ans,dp[i]);
     printf("%d\n",ans);
 }
 int main()
 {
     while (scanf("%d",&n)!=EOF)
     {
         ;i<=n;i++)
         scanf("%d%d%d",&f[i].weight,&f[i].a,&f[i].c);
         sort(f+,f+n+,cmp);
         Dp();
     }
     ;
 }