hdu2602 Bone Collector _简单的01背包

 

Bone Collector

 

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

 

 

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 231).

 

 

Sample Input

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

 

 

Sample Output

14

 

 

 

简单的01背包问题

 

//
// Created by Admin on 2017/3/13.
//

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

int value[1010],volume[1010],dp[1010][1010];  //value:骨头的价值 volume:骨头的体积
int main(){
    int t,n,v;
    scanf("%d",&t);
    while (t--){
        scanf("%d%d",&n,&v);
        memset(dp,0, sizeof(dp));
        for (int i = 0; i < n; ++i) {
            scanf("%d",&value[i]);
        }
        for (int j = 0; j < n; ++j) {
            scanf("%d",&volume[j]);
        }
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j <=v; ++j) {
                if(j<volume[i])dp[i+1][j]=dp[i][j];
                else dp[i+1][j]=max(dp[i][j],dp[i][j-volume[i]]+value[i]);
            }
        }
        printf("%d\n",dp[n][v]);
    }
    return 0;
}