Bone Collector+hdu+一道01背包的最基本模板

Bone Collector

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 29954    Accepted Submission(s): 12323

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
  
  
  
  

   
   解决方案：01背包经典问题，
  
  
  
  

   
   for i=1....n
  
  
  
  

   
    for j=sum.....G[i].v
  
  
  
  

   
     dp[j]=max(dp[j],dp[j-G[i].v]+G[i].value)；
  
  
  
  

   
   code:
   
   
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int dp[1003];
int N,V;
struct bone{
int value,volume;
} B[1003];
int main()
{
    int  t;
    scanf("%d",&t);
    while(t--){
        scanf("%d%d",&N,&V);
        for(int i=0;i<N;i++){
            scanf("%d",&B[i].value);
        }
        for(int i=0;i<N;i++){
            scanf("%d",&B[i].volume);
        }
        memset(dp,0,sizeof(dp));
        for(int i=0;i<N;i++)
        for(int j=V;j>=B[i].volume;j--){
            dp[j]=max(dp[j],dp[j-B[i].volume]+B[i].value);
        }
        printf("%d\n",dp[V]);
    }
    return 0;
}