【多重背包问题二进制优化】AcWing5.多重背包问题 II

AcWing5.多重背包问题 II

题解

#include <iostream>

using namespace std;

const int N = 20010, M = 2010;

int v[N], w[N], cnt, n, m, f[M];

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