51nod--多重揹包

原題鏈接

代碼如下：

#include <bits/stdc++.h>
using namespace std;
int d[50005];
int main()
{
	int n, m, w, p, c;
	
	scanf( "%d%d", &n, &m);
	memset( d, 0, sizeof( d));
	for ( int i = 1; i <= n; i++){
     	scanf( "%d%d%d", &w, &p, &c);
     	if ( w * c >= m){
          	for ( int j = w; j <= m; j++){
               	d[j] = max( d[j], d[j - w] + p);
          	}
     	}
     	else{
         	int x = 1;
         	while ( x < c){
              	for ( int j = m; j >= x * w; j--){
                   	d[j] = max( d[j], d[j - x * w] + x * p);
             	}
              	c -= x;
              	x *= 2;
        	}
         	for ( int j = m; j >= c * w; j--){
              	d[j] = max( d[j], d[j - c * w] + c * p);
         	}
     	}
	}
	printf( "%d\n", d[m]);
	return 0;
}