题目链接
活动 - AcWing 本课程系统讲解常用算法与数据结构的应用方式与技巧。https://www.acwing.com/problem/content/1021/今天是背包九讲的第三讲,多重背包问题。废话不多说,直接上闫氏dp法
一维优化代码
#include <iostream>
using namespace std;
const int N = 510, M = 6010;
int n, m;
int v[N], w[N], s[N];
int f[M];
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 = m; j >= v[i]; -- j)
{
for (int k = 0; k <= s[i]; ++ k)
{
if (j - k * v[i] >= 0)
{
f[j] = max(f[j], f[j - k * v[i]] + k * w[i]);
}
}
}
}
cout << f[m] << endl;
return 0;
}