HDU 2602 Bone Collector（01背包）

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 ³¹).

 

Sample Input

  
  

   
   1
5 10
1 2 3 4 5
5 4 3 2 1
  
  

 

Sample Output

  
  

   
   14
  
  
  
  


  
  

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string.h>
//#include <cmath>
using namespace std; 
const int A=1050;
int w[A];
int v[A];
int f[A][A];
int main(){
	int t;
	scanf("%d",&t);
	while(t--){
		memset(f,0,sizeof(f));
		int N,V;
		scanf("%d %d",&N,&V);
		for(int i=1;i<=N;i++){
			scanf("%d",&v[i]);//value;
		}
		for(int i=1;i<=N;i++){
			scanf("%d",&w[i]);//weight;
		}
		
		for(int i=1;i<=N;i++){
			for(int j=0;j<=V;j++){
				if(j<w[i]) f[i][j]=f[i-1][j];
				else f[i][j]=max(f[i-1][j-w[i]]+v[i],f[i-1][j]);

			}
		}
		
        
		printf("%d\n",f[N][V]);
		
	}
}

题意：背包重量为V，有N个骨头，价值和质量分别为vi，wi；求拿的骨头总质量为V时的最大价值；

典型的01背包；对于每个骨头，我们可以选择拿或不拿；定义f[i][j]为拿到第i个骨头，背包容量为j时的最大价值；拿的话就是上一个状态i-1个骨头，背包容量为j-w[i]时的价值加上拿的骨头价值v[i]；不拿的话就还是上一个状态的价值；

当j<w[i]时拿不了骨头，那么就还是上一个状态的价值；

代入N,V即可；