HDU2602 Bone Collector【0/1背包+DP】

 

Bone Collector

 

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

 

 

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

 

 

Author

Teddy

 

 

Source

HDU 1st “Vegetable-Birds Cup” Programming Open Contest

 

 

 

问题链接：HDU2602 Bone Collector

问题简述：（略）

问题分析：

  教科书经典0/1背包问题，不解释。

程序说明：（略）

题记：（略）

参考链接：（略）

 

AC的C++语言程序如下：

 

/* HDU2602 Bone Collector */

#include <iostream>
#include <stdio.h>
#include <string.h>

using namespace std;

const int N = 1000;
int v2[N], w[N], dp[N];


int main()
{
    int t, n, v;

    scanf("%d", &t);
    while(t--) {
        cin >> n >> v;
        for(int i=0; i<n; i++)
            cin >> v2[i];
        for(int i=0; i<n; i++)
            cin >> w[i];

        memset(dp, 0, sizeof(dp));

        for(int i=0; i<n; i++)
            for(int j=v; j>=w[i]; j--)
                if(j >= w[i])
                    dp[j] = max(dp[j], dp[j - w[i]] + v2[i]);

        cout << dp[v] << endl;
    }

    return 0;
}