参考题目:
AcWing 2. 01背包问题
状态表示:
f[i][j]
:在前i
个物品中选,且总体积不超过j
的所有方案。答案为f[n][m]
属性
:总价值的Max
状态计算:
- 选
i
的:f[i - 1][j - v[i]] + w[i]
- 不选
i
的:f[i - 1][j]
- 综上
f[i][j] = max(f[i - 1][j], f[i - 1][j - v[i]] + w[i])
代码:
朴素版
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 1010;
int n, m;
int v[N], w[N];
int f[N][N];
int main()
{
cin >> n >> m;
for (int i = 1; i <= n; i ++ ) cin >> v[i] >> w[i];
for (int i = 1; i <= n; i ++ )
for (int j = 0; j <= m; j ++ )
{
f[i][j] = f[i - 1][j];
if (j >= v[i]) f[i][j] = max(f[i][j], f[i - 1][j - v[i]] + w[i]);
}
cout << f[n][m] << endl;
return 0;
}
优化成一维的
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 1010;
int n, m;
int v[N], w[N];
int f[N];
int main()
{
cin >> n >> m;
for (int i = 1; i <= n; i ++ ) cin >> v[i] >> w[i];
for (int i = 1; i <= n; i ++ )
for (int j = m; j >= v[i]; j -- ) // 01背包需要逆序循环
f[j] = max(f[j], f[j - v[i]] + w[i]);
cout << f[m] << endl;
return 0;
}
参考资料:
https://www.acwing.com/video/944/