3.多重背包问题 I

 

 多重背包问题是每个物品最多有s[i]个

多重背包问题有朴素版和优化版

dp[i][j]只从前i个物品中选，体积<=j的最大值

根据第i个物品选多少个来划分

三重循环的暴力做法

#include <bits/stdc++.h>
using namespace std;
const int N = 110;
int dp[N][N], v[N], w[N], s[N];
int main() {
    int n, m;
    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++) {
                dp[i][j] = max(dp[i][j], dp[i - 1][j - k * v[i]] + k * w[i]);
            }
        }
    }
    cout << dp[n][m] << endl;
    return 0;
}