AcWing 4. 多重背包问题 I
原题链接
简单
作者:
跟着灿哥学切菜
,
2021-01-11 17:09:07
,
所有人可见
,
阅读 246
#include <iostream>
using namespace std;
const int N = 800;
int v[N], w[N];
int f[110];
int main() {
int n, m;
cin >> n >> m;
int cnt = 0;
for (int i = 1; i <= n; i++) {
int a, b, s;
cin >> a >> b >> s;
for (int k = 1; k <= s; k *= 2) {
cnt ++;
v[cnt] = k * a;
w[cnt] = k * b;
s -= k;
}
if (s > 0) {
cnt ++;
v[cnt] = s * a;
w[cnt] = s * b;
}
}
n = cnt;
for (int i = 1; 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 0;
}