Bone Collector -简单01背包

拼搏现实的明天。 2022-06-06 09:06 145阅读 0赞

# Bone Collector #

## 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 ?

![C154-1003-1.jpg][]

## 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\[sup\]31\[/sup\]).

## Sample Input ##

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

## Sample Output ##

#include <bits/stdc++.h>
    using namespace std;
    int N;//物品个数
    int V;//背包最大容量
    int weight[1005];//物品体积
    int value[1005];//物品价值
    int f[1005];
    int ZeroOnePack()
    {
        memset(f,0,sizeof(f));
        //递推
        for (int i = 0;i < N;i++) //枚举物品(注意物品的编号)
        {
            for (int j = V;j >= weight[i];j--) //枚举背包容量,防越界，j下限为 weight[i]！！！
            {
                f[j] = max(f[j],f[j - weight[i]] + value[i]);
                //cout << j << " " << f[j] << endl;
            }
        }
        return f[V];
    }
    int main()
    {
        int t;
        scanf("%d",&t);
        while(t--)
        {
            scanf("%d %d",&N,&V);
            for(int i=0;i<N;i++)
            {
                scanf("%d",&value[i]);
            }
            for(int i=0;i<N;i++)
            {
                scanf("%d",&weight[i]);
            }
            cout << ZeroOnePack() << endl;
        }
    
        return 0;
    }

[C154-1003-1.jpg]: /images/20220606/4dfcb63e47b843edb8403459c8feab02.png