算法类型:
动态规划
算法原理:
V[i, j] = 0 (i=0或j=0)
= V[i-1][j] (j < si)
= max { V[i-1][j], V[i-1][j-si] + vi }
算法时间复杂度:
theta(nC) 表的大小
最优解可在theta(C)空间内得到。
代码实现:hdu2602
/*
* 0/1背包问题
*/
#include <iostream>
using namespace std;
const int size = 1005;
int V[size][size];
int wei[size];
int val[size];
int MAX(int a, int b) {
return a>b?a:b;
};
int main()
{
int T, n, C;
scanf("%d",&T);
while (T --) {
scanf("%d%d",&n,&C);
for (int i = 1; i <= n; ++ i)
scanf("%d",val+i);
for (int i = 1; i <= n; ++ i)
scanf("%d",wei+i);
for (int i = 0; i <= n; ++ i) {
V[i][0] = 0;
}
for (int i = 0; i <= C; ++ i) {
V[0][i] = 0;
}
// 此题变态,j从0开始,有的骨头有价值,但是重量为0
for (int i = 1; i <= n; ++ i)
for (int j = 0; j <= C; ++ j) {
V[i][j] = V[i-1][j];
if (wei[i] <= j) {
V[i][j] = MAX(V[i][j],V[i-1][j-wei[i]]+val[i]);
}
}
printf("%d\n",V[n][C]);
}
}