AcWing 4. 多重背包问题 I
原题链接
简单
作者:
我要出去乱说
,
2021-01-27 09:49:14
,
所有人可见
,
阅读 288
朴素做法
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 1010;
int f[N][N];
int n, m;
int v[N], w[N], s[N];
int main()
{
cin >> n >> m;
for (int i = 1; i <= n; i ++ ) cin >> v[i] >> w[i] >> s[i];
for (int i = 1; i <= n; i ++ )
for (int j = 0; j <= m; j ++ )
for (int k = 0; k <= s[i] && k * v[i] <= j; k ++ ) //k为物品限制个数
if (k * v[i] <= j) f[i][j] = max(f[i][j], f[i - 1][j - k * v[i]] + k * w[i]);
cout << f[n][m];
return 0;
}