TYVJ1276

 1 #include <cstdio>
 2 #include <cstring>
 3 #include <iostream>
 4 #include <algorithm>
 5 using namespace std;
 6 const int maxv = 50005;
 7 const int maxn = 500;
 8 int dp[maxv],w[maxn],v[maxn];
 9 int main()
10 {
11    freopen("in.txt","r",stdin);
12     int n,m,cnt = 0;
13     cin>>n>>m;
14     for(int i = 1;i<=n;++i)
15     {
16         int a,g,p;
17         cin>>a>>g>>p;
18         if(a==-1)a = m/g;
19         int x = 1;
20         while(a>=x)
21         {
22             w[cnt] = x*g;
23             v[cnt++] = x*p;
24             a-=x;
25             x*=2;
26         }
27         if(a){w[cnt] = a*g;v[cnt++]=a*p;}
28     }
29     printf("cnt=%d\n",cnt);
30     memset(dp,0,sizeof(dp));
31     for(int i = 0;i<cnt;++i)
32         for(int j = m;j>=w[i];--j)
33             dp[j]=max(dp[j],dp[j-w[i]]+v[i]);
34     printf("%d\n",dp[m]);
35 
36     return 0;
37 }