acwing算法题--混合背包问题

原题链接：https://www.acwing.com/problem/content/7/

#include <iostream>
#include <vector>using namespace std;const int N = 1010;
struct Thing {int kind;int v, w;
};
vector<Thing> things;
int dp[N];int main() {int n, m;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 {for (int k = 1; k <= s; k *= 2) {s -= k;things.push_back({-1, k * v, k * w});}if (s > 0) {things.push_back({-1, s * v ,s * w});}}}for (auto thing: things) {if (thing.kind == -1) {for (int i = m; i >= thing.v; i--) {dp[i] = max(dp[i], dp[i - thing.v] + thing.w);}} else {for (int i = thing.v; i <= m; i++) {dp[i] = max(dp[i], dp[i - thing.v] + thing.w);}}}cout << dp[m] << endl;return 0;
}

acwing算法题--混合背包问题相关推荐

acwing算法题--完全背包问题
原题链接:https://www.acwing.com/problem/content/3/ package mainimport "fmt" const N = 1010 var ...
acwing算法题--多重背包问题二
原题链接:https://www.acwing.com/problem/content/5/ #include <iostream> #include <vector>usin ...
acwing算法题--多重背包问题一
原题链接:https://www.acwing.com/problem/content/4/ package mainimport "fmt"const N = 1010var d ...
acwing算法题--01背包问题
原题链接:https://www.acwing.com/problem/content/2/ 使用动态规划 package mainimport "fmt"const N = 10 ...
acwing算法题--分组背包问题
原文链接:https://www.acwing.com/problem/content/9/ #include <iostream>using namespace std;const in ...
AcWing算法题常用代码模板
一.基础算法 1.常用代码模板快速排序算法模板 -- 模板题 AcWing 785. 快速排序算法步骤: ①确定分界点 ②调整区间 ③递归处理左右两段 Tips: ①如果输入数据量 ...
acwing算法题--二维费用的背包问题
原题链接:https://www.acwing.com/problem/content/8/ #include <iostream>using namespace std;const in ...
acwing算法题--铁路与公路
原题链接:https://www.acwing.com/problem/content/description/4077/ #include <iostream> #include < ...
acwing算法题--看图做题
原题链接:https://www.acwing.com/problem/content/3992/ 找规律题 #include<iostream>using namespace std;i ...

acwing算法题--混合背包问题

acwing算法题--混合背包问题相关推荐

最新文章

热门文章