HDU - 2602 Bone Collector（简单01背包）

点击打开题目链接

Bone Collector

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

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

Recommend

lcy   |   We have carefully selected several similar problems for you:   1203  2159  1171  2191  2844 

Statistic | Submit | Discuss | Note

题目大意：

给出物品数量和背包容量及每件物品的价值和重量。求最高价值。

思路：

每件物品仅有一件，所以是一个裸的01背包问题。

状态方程dp[j] = max(dp[j], dp[j - vol[i]] + val[i]);

附上AC代码：

#include<iostream>
#include<cstring>
#include<algorithm>

using namespace std;
const int maxn = 1000 + 5;
typedef long long ll;
ll dp[maxn];
int T;
int N, V;

struct nodes{
    ll val, vol;
}node[maxn];

int main() {
    ios :: sync_with_stdio(false);
    cin >> T;
    while(T--) {
        memset(dp, 0, sizeof(dp) );
        cin >> N >> V;
        for(int i = 0; i < N; i++)
            cin >> node[i].val;
        for(int i = 0; i < N; i++)
            cin >> node[i].vol;
        memset(dp, 0, sizeof(dp) );
        for(int i = 0; i < N; i++){
            for(int j = V; j >= node[i].vol; j--){
                dp[j]=max(dp[j],dp[j-node[i].vol]+node[i].val);
            }
        }
        cout<<dp[V]<<endl;
    }
    return 0;
}