//二进制优化 最后变为01背包
#include <iostream>
#include <algorithm>
using namespace std;
const int N = , M = ;
int n, m;
int v[N], w[N];
int f[M];
int main() {
cin >> n >> m;
int cnt = ;
for (int i = ; i <= n; i ++ ) {
int a, b, s;
cin >> a >> b >> s;
int k = ;
while (k <= s) {//二进制优化
cnt ++ ;
v[cnt] = a * k;
w[cnt] = b * k;
s -= k;
k *= ;
}
if (s > ) {
cnt ++ ;
v[cnt] = a * s;
w[cnt] = b * s;
}
}
n = cnt;
for (int i = ; i <= n; i ++ )
for (int j = m; j >= v[i]; j -- )
f[j] = max(f[j], f[j - v[i]] + w[i]);
cout << f[m] << endl;
return ;
}
AcWing 5. 多重背包问题 II的相关教程结束。
