版本1
- 完全背包版本
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
using namespace std;
const int N = 2048;
int mm[N], w[N], s[N];
int dp[N][N];
int main(){
int n, m;
scanf("%d %d", &n, &m);
for(int i = 1; i <= n; i++)
scanf("%d %d %d", &mm[i], &w[i], &s[i]);
for(int i = 1; i <= n; i++)
for(int j = 0; j <= m; j++)
for(int k = 0; k <= mm[i] && k*w[i] <= j; k++)
dp[i][j] = max(dp[i][j], dp[i-1][j-w[i]*k] + s[i]*k);
printf("%d", dp[n][m]);
return 0;
}