0. 前言
相关:
1. 01背包裸题
特点:
- 每件物品最多只用一次
裸题。时间复杂度为背包数量 * 物品数量,
O
(
n
m
)
O(nm)
O(nm)。
代码:
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 1005;
int n, m;
int v[N], w[N];
int f[N];
int main() {
cin >> n >> m;
for (int i = 1; i <= m; ++i) cin >> v[i] >> w[i];
for (int i = 1; i <= m; ++i)
for (int j = n; j >= v[i]; --j)
f[j] = max(f[j], f[j - v[i]] + w[i]);
cout << f[n] << endl;
return 0;
}
简写优化代码:
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 1005;
int n, m;
int f[N];
int main() {
cin >> n >> m;
for (int i = 1; i <= m; ++i) {
int v, w;
cin >> v >> w;
for (int j = n; j >= v; --j)
f[j] = max(f[j], f[j - v] + w);
}
cout << f[n] << endl;
return 0;
}