AcWing 9. 分组背包问题
原题链接
中等
作者:
我要出去乱说
,
2021-01-27 13:32:13
,
所有人可见
,
阅读 502
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 110;
int n, m;
int v[N][N], w[N][N], s[N]; //s存每组物品个数
int f[N];
int main()
{
cin >> n >> m;
for (int i = 1; i <= n; i ++ )
{
cin >> s[i];
for (int j = 0; j < s[i]; j ++ )
cin >> v[i][j] >> w[i][j]; //v[i][j]表示第i组第j件物品的体积
}
for (int i = 1; i <= n; i ++ )
for (int j = m; j >= 0; j -- ) //能重复取的就从前往后遍历,不能重复取的就从后往前遍历
for (int k = 0; k < s[i]; k ++ )
if (v[i][k] <= j)
f[j] = max(f[j], f[j - v[i][k]] + w[i][k]);
cout << f[m] << endl;
return 0;
}