01背包的DP状态转移方程:
考虑 要装 第i件物品:
(1)、如果背包装的下第i件物品,则state[i][j] = max {state[i-1][j] , state[i-1][j-w[i]]+v[i]};
(2)、如果背包装不下第i件物品,则state[i][j] = state[i-1][j];
基于上述思想,容易写出二维空间的DP:
#include <iostream>
#include <fstream>
using namespace std;
int max(int x,int y)
{
return x > y ? x : y;
}
int main()
{
//fstream in("input.txt");
int n, m;
cin >> n >> m;
int *weight = new int[n+1];
int *value = new int[n+1];
int **state = NULL;
state = new int*[n + 1];
for (int i = 0; i <= n; i++)
state[i] = new int[m+1];
for (int i = 0; i<=n; i++)
for (int j = 0; j<=m; j++)
state[i][j]=0;
for (int i = 1; i <= n; i++)
{
cin >> weight[i];
cin >> value[i];
}
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= m; j++)
{
if (j >= weight[i])//如果背包装的下第i个物品,就去选max{第i-1次,第i次}的状态值
state[i][j] = max(state[i - 1][j] , state[i - 1][j - weight[i]] + value[i]);
else//如果背包装不下第i个物品,状态和第i-1次相同
state[i][j] = state[i - 1][j];
}
}
cout << state[n][m] << endl;
//system("pause");
return 0;
}
但是,本题使用二维会MLE,因此需要对空间进行优化:
原因是:设 1<=i<=n , 1<=j<=m
观察上面代码,每一次计算新的state[i][j]都只会用到上一行,也就是第state[i-1]行的第1个到第j个元素的值,后面的元素都不会用到,所以如果将这n行合并成一行(相当于降维),并且从后往前计算state[j]的值,是可以的。从前往后计算state[j]的值不行的原因是:如果state[j]变了,计算state[j+1]时实际上是要用到上一行没有变过的state[j]。
#include <iostream>
#include <fstream>
using namespace std;
int max(int x, int y)
{
return x > y ? x : y;
}
int main()
{
//fstream in("input.txt");
int n, m;
cin >> n >> m;
int *w = new int[n + 1];
int *v = new int[n + 1];
int *state = new int[m + 1];
for (int i = 1; i <= n; i++)
{
cin >> w[i];
cin >> v[i];
}
for (int i = 0; i <= m; i++)
{
state[i] = 0;
}
for (int i = 1; i <= n; i++)
{
for (int j = m; j >= w[i]; j--)
{
state[j] = max(state[j],state[j-w[i]]+v[i]);
}
}
cout << state[m] << endl;
//system("pause");
return 0;
}