单调队列优化多重背包

最新推荐文章于 2024-08-03 16:19:48 发布

从未放弃过~~

最新推荐文章于 2024-08-03 16:19:48 发布

阅读量1k

点赞数 30

文章标签：数据结构算法

本文链接：https://blog.csdn.net/2301_79921837/article/details/136188622

版权

本文介绍了如何使用单调队列对多重背包问题进行优化，通过两次遍历和队列操作，降低了时间复杂度，以C++代码形式展示了算法过程。

摘要由CSDN通过智能技术生成

单调队列优化多重背包

#include<bits/stdc++.h>
using namespace std;
#define maxn 110
int n, m, v[maxn], w[maxn], s[maxn];
int f[maxn];
struct Goods{
    int w, v;
};
vector<Goods>goods;

int main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    cin >> n >> m;
    for (int i = 1; i <= n; i++){
        cin >> v[i] >> w[i] >> s[i];

        for (int k = 1; k <= s[i]; k *= 2){
            s[i] -= k;
            goods.push_back({ w[i] * k, v[i] * k });
        }
        if (s[i] > 0)goods.push_back({ s[i] * w[i], s[i] * v[i] });
    }
    //i 10件 1010 1件 2件 4件 3件
    for (int i = 0; i <= goods.size(); i++){
        for (int j = m; j >= goods[i].w; j--){
            f[j] = max(f[j], f[j - goods[i].w] + goods[i].v);
        }
    }//o(m*n*logm)<(m*sigmas[i] 2000*1000*15)

    /*for (int i = 1; i <= n; i++){
        for (int j = 0; j <= m; j++){
            for (int k = 0; k <= s[i]; k++){
                if (j >= k*w[i])f[i - 1][j - w[i] * k] + v[i] * k;
            }
        }
    }*/
    cout << f[n] << "\n";
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
#define maxn 20010
int n, m, v[maxn], w[maxn], s[maxn];
int f[2][maxn];
struct Goods{
    int w, v;
};
int q[maxn];
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 r = 0; r <= v[i]; ++r){
            int hh = 0, tt = 1;
            for (int j = r; j <= m; j += v[i]){
                while (hh <= tt&&j - q[hh] > s[i] * v[i])hh++;
                while (hh <= tt&&f[(i - 1) & 1][q[tt]] + (j - q[tt]) / v[i] * w[i] <= f[(i - 1) & 1][j])--tt;
                q[++tt] = j;
                f[i & 1][j] = f[(i - 1) & 1][q[hh]] + (j - q[hh]) / v[i] * w[i];
            }
        }
    }//O(n*m)
    cout << f[n & 1][m] << "\n";
    return 0;
}