1.01背包(物品只能拿或者不拿)
#include <iostream>
using namespace std;
const int N = 1e5 + 10;
int n, V;
int w[N], v[N];
int dp[N];
int main()
{
cin >> n >> V;
for (int i = 0; i < n; i++) {
cin >> v[i] >> w[i];
}
dp[0] = 0;
for (int i = 0; i < n; i++) { // 枚举每个物品
for (int j = V; j >= v[i]; j--) {// 枚举背包容量
dp[j] = max(dp[j], dp[j - v[i]] + w[i]); // 体积 价值 从前n个物品的最大价值
}
}
cout << dp[V] << endl;
}
2.完全背包(物品可以选无限次)
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 1e5 + 10;
int dp[N];
int w[N], v[N];
int V, n;
int main() {
cin >> n >> V;
for (int i = 0; i < n; i++ ){
cin >> v[i] >> w[i];
}
for (int i = 0; i < n; i++) {
for (int j = v[i]; j <= V; j++) {
dp[j] = max(dp[j], dp[j - v[i]] + w[i]);
}
}
cout << dp[V] << endl;
}
3.多重背包Ⅰ(物品的数量有限制)
#include <iostream>
using namespace std;
const int N = 101;
int n, V;
int v[N], w[N], s[N], dp[N];
// 体积 价值 数量
int main() {
cin >> n >> V;
for (int i = 0; i < n; i++)
cin >> v[i] >> w[i] >> s[i];
for (int i = 0; i < n; i++) {
for (int k = 1; k <= s[i]; k++) {
for (int j = V; j >= v[i]; j--) { // 不能乘k次,因为状态是叠加的,但k=2的时候其实背包里已经有k=1的情况了
dp[j] = max(dp[j], dp[j - v[i]] + w[i]);
}
}
}
cout << dp[V] << endl;
return 0;
}
内层的循环调换顺序
#include <iostream>
using namespace std;
const int N = 101;
int n, V;
int v[N], w[N], s[N], dp[N];
// 体积 价值 数量
int main() {
cin >> n >> V;
for (int i = 0; i < n; i++)
cin >> v[i] >> w[i] >> s[i];
for (int i = 0; i < n; i++) {
for (int j = V; j >= v[i]; j--) {
for (int k = 1; k <= s[i] && k * v[i] <= j; k++)
dp[j] = max(dp[j], dp[j - v[i] * k] + w[i] * k);
}
}
cout << dp[V] << endl;
return 0;
}
4.多重背包Ⅱ(二进制拆分)
#include <iostream>
#include <vector>
using namespace std;
const int N = 2010;
vector<pair<int, int> > goods;
int dp[N];
int main() {
int n, V, v, w, s, k;
cin >> n >> V;
for (int i = 0; i < n; i++) {
cin >> v >> w >> s;
// 二进制拆分
for (k = 1; k < s; k <<= 1) {
goods.push_back({v * k, w * k});
s -= k;
}
if (s) {
goods.push_back({v * s, w * s});
}
}
// 01背包
n = goods.size();
for (int i = 0; i < n; i++) {
for (int j = V; j >= goods[i].first; j--) {
dp[j] = max(dp[j], dp[j - goods[i].first] + goods[i].second);
}
}
cout << dp[V] << endl;
}