HUD2602（经典0-1背包）

Bone Collector

Problem Description
Many years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bones , such as dog’s , cow’s , also he went to the grave …
The bone collector had a big bag with a volume of V ,and along his trip of collecting there are a lot of bones , obviously , different bone has different value and different volume, now given the each bone’s value along his trip , can you calculate out the maximum of the total value the bone collector can get ?

Input
The first line contain a integer T , the number of cases.
Followed by T cases , each case three lines , the first line contain two integer N , V, (N <= 1000 , V <= 1000 )representing the number of bones and the volume of his bag. And the second line contain N integers representing the value of each bone. The third line contain N integers representing the volume of each bone.

Output
One integer per line representing the maximum of the total value (this number will be less than $2^{31}$).

Sample Input
1
5 10
1 2 3 4 5
5 4 3 2 1

Sample Output
14

1. 使用2维数组
   $dp[i][j]$ 表示考虑了第 i 个物品，背包内物品总体积不超过 j 时的价值

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int dp[1005][1005];
int val[1005];
int vol[1005];


int main(){
	int T,N,V,max1;
	scanf("%d",&T);
	while(T--){
		scanf("%d %d",&N,&V);
		for(int i=1;i<=N;i++){
			scanf("%d",&val[i]);
		} 
		for(int i=1;i<=N;i++){
			scanf("%d",&vol[i]);
		}
		
		memset(dp,0,sizeof(dp));
		for(int i=1;i<=N;i++){
			for(int j=V;j>=0;j--){
				if(j>=vol[i])
				    dp[i][j]=max(dp[i-1][j],dp[i-1][j-vol[i]]+val[i]);
				else
				    dp[i][j]=dp[i-1][j];
			} 
		}
		printf("%d\n",dp[N][V]);
	}
	
	return 0;
}

2. 简化为一维数组
   $dp[j]$ 表示当前背包内物品总体积不超过$j$时的价值

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int dp[1005];
int val[1005];
int vol[1005];


int main(){
	int T,N,V;
	scanf("%d",&T);
	while(T--){
		scanf("%d %d",&N,&V);
		for(int i=1;i<=N;i++){
			scanf("%d",&val[i]);
		} 
		for(int i=1;i<=N;i++){
			scanf("%d",&vol[i]);
		}
		
		memset(dp,0,sizeof(dp));
		for(int i=1;i<=N;i++){
			for(int j=V;j>=vol[i];j--){
				dp[j]=max(dp[j],dp[j-vol[i]]+val[i]);
			} 
		}
		printf("%d\n",dp[V]);
	}
	
	return 0;
}