多重背包问题三种写法 （c++）

第一种直接暴力法， 数据要求比较小的时候可以， 不然会tle

#include <iostream>
#include <algorithm>

using namespace std;

const int N = 110;

int n, m;
int v[N], w[N], s[N];
int f[N][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 ++ )
                f[i][j] = max(f[i][j], f[i - 1][j - v[i] * k] + w[i] * k);

    cout << f[n][m] << endl;
    return 0;
}

第二种是用c++滴vector写的

#include <iostream>
#include <algorithm>
#include <vector>
#include <cstring>

using namespace std;

const int N =1e06 + 10;
int n, m;
int q[N];
struct good{
    int v, w;
};

int main() {
    vector<good> goods;
    cin >> n >> m;
    
    for (int i = 1; i <= n; i++) {
        int a, b, s;
        cin >>a >> b >> s;
        for (int k = 1; k <= s; k *= 2) {
            s -= k;
            goods.push_back({a * k, b * k});
        }
        if (s > 0) {
            goods.push_back({a * s, b * s});
        }
    }
    
    for (auto good : goods) {
        for (int j = m;  j >= good.v; j--) {
            q[j] = max(q[j], q[j - good.v] + good.w);
        }
    }
    cout << q[m];
    return 0;
}

第三种呢就是不用vector， 我也比较喜欢的方法

#include <iostream>

using namespace std;
const int N =1e06 + 10;

int q[N], v[N], w[N], s[N];
int main() {
    int n, m;
    cin >> n >> m;

    int cnt = 0;
    for (int i = 1; i <= n; i++) {
        int a, b, s;
        cin >> a >> b >> s;
        int k = 1;
        while (k <= s) {
            cnt ++;
            v[cnt] = a * k;
            w[cnt] = b * k;
            s -= k;
            k *= 2;
        }
        if (s > 0) {
            cnt ++;
            v[cnt] = s * a;
            w[cnt] = s * b;
        }
    }
    n = cnt;
    
    for (int i = 1; i <= n; i++) {
        for (int j = m; j >= v[i]; j--) {
            q[j] = max(q[j], q[j - v[i]] + w[i]);
        }
    }

    cout << q[m];
    return 0;
}

继续肝呜呜呜