混合背包问题

 

#include<iostream>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;

const int N=1010;
int n,m;
int f[N];

struct Thing
{
    int kind;  /*背包问题种类*/
    int v,w;
};
vector<Thing> things;  /*创建一个Thing类型的向量*/

int main()
{
    cin >> n >> m;
    for(int i = 0; i < n; i++)
    {
        int v,w,s;
        cin >> v >> w >> s;
        if(s < 0)
        {
            things.push_back({-1, v, w});
        }
        else if (s==0)
        {
            things.push_back({0,v,w});
        }
        else  /*用二进制的方法将多重背包问题简化为01背包问题*/
        {
            for(int k = 1; k < s; k *= 2)
            {
                s -= k;
                things.push_back({-1, v*k, w*k});
            }
            if(s > 0)
            {
                things.push_back({-1, v*s, w*s});
            }
        }
    }
    /*通过thing将things中的所有元素遍历一遍，auto为自动识别thing的类型*/
    for(auto thing : things)  
    {
        if(thing.kind < 0)
        {
            for(int j = m; j >= thing.v; j--)
            {
                f[j] = max(f[j], f[j-thing.v] + thing.w);
            }
        }
        else
        {
            for(int j = thing.v; j <=m; j++)
            {
                f[j] = max(f[j], f[j-thing.v]+thing.w);
            }
        }
    }
    cout << f[m] << endl;
    return 0;
}