拆分法-多重背包问题转化成01背包问题

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 110;
int v[N], w[N], s[N];
int n, m;
int f[N];

int main() {
    cin >> n >> m;
    for (int i = 1; i <= n; i++) cin >> w[i] >> v[i] >> s[i];

    for (int i = 1; i <= n; i++) {
        for (int k = 1; k <= s[i]; k++) {  // 拆分成多个物品，每次循环都会变成从前i+k个物品中选，总和不超过j的方案的集合
            for (int j = m; j >= w[i]; j--) {
                f[j] = max(f[j], f[j - w[i]] + v[i]);
            }
        }
    }
    cout << f[m] << endl;

    return 0;
}