2602 Bone Collector_bone collector csdn‘-CSDN博客

本文链接：https://blog.csdn.net/m0_52796585/article/details/119989344

题目详情：

Bone Collector

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

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

5 10

1 2 3 4 5

5 4 3 2 1

Sample Output

Author

Teddy

Source

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

Recommend

lcy | We have carefully selected several similar problems for you: 1203 2159 2955 1171 1003

题目大意：

每个骨头都有价值和体积，背包容量有限，并且每一个骨头都只有一个，问在背包容量范围内如何装骨头使背包里骨头的价值最大。

解题思路：

用DP二维数组记录当前价值最大的价值，直到遍历到最后一个元素，即为最大价值。

AC代码：

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
class bone{
    public:
        long long int value;
        long long int place;
};
int main(){
    int n;
    cin>>n;
    while(n--){
        int num,v;
        cin>>num>>v;
        bone b[num+1];
        b[0].place=0;
        b[0].value=0;
        for(int i=1;i<=num;++i){
            cin>>b[i].value;
        }
        for(int i=1;i<=num;++i){
            cin>>b[i].place;
        }
        vector<vector<long long int>> dp(num+1,vector<long long int>(v+1,0));
        for(int i=1;i<=num;++i){
            for(int j=0;j<=v;++j){
                if(b[i].place<=j){
                    dp[i][j]=max(dp[i-1][j-b[i].place]+b[i].value,dp[i-1][j]);
                }
                else dp[i][j]=dp[i-1][j];//继承上一行
            }
        }
        cout<<dp[num][v]<<endl;
    }
    return 0;
}

对空间进行优化，二维数组变成一维数组后AC代码：

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
class bone{
    public:
        long long int value;
        long long int place;
};
int main(){
    int n;
    cin>>n;
    while(n--){
        int num,v;
        cin>>num>>v;//num:物品个数,v:背包容量
        bone b[num+1];
        b[0].place=0;
        b[0].value=0;
        for(int i=1;i<=num;++i){
            cin>>b[i].value;
        }
        for(int i=1;i<=num;++i){
            cin>>b[i].place;
        }
        //用一维数组方法
        vector<long long int> dp(v+1,0);
        for(int i=1;i<=num;++i){
            //j表示背包容量
            for(int j=v;j>=b[i].place;--j){//没必要循环到0，体积小于背包空间肯定放不下
                dp[j]=max(dp[j-b[i].place]+b[i].value,dp[j]);
            }
        }
        cout<<dp[v]<<endl;
    }
    return 0;
}