Bone Collector（ZeroOnebag）

最新推荐文章于 2021-01-18 14:47:36 发布

转载最新推荐文章于 2021-01-18 14:47:36 发布 · 54 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/a1225234/p/4695347.html

本文探讨了骨收集者在收集不同体积和价值的骨头时，如何利用一维01背包算法最大化其总价值。通过实例分析，详细介绍了如何根据给定的骨头数量、背包容量、骨头价值和体积，计算出最大总价值。

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 ?

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³¹).

Sample Input

5 10

1 2 3 4 5

5 4 3 2 1

Sample Output

　模板题，找到状态转移方程，使用一维01背包，对于背包的体积要逆序遍历，这样是的右边的max(f[j],f[j-v[i]]+val[i])能够表示为上一层的状态，而对于当j<v[i时，默认f[j]不变，是上一层的值

 1 #include <iostream>
 2 #include <algorithm>
 3 #include <cstring>
 4 using namespace std;
 5 int main()
 6 {
 7     int T,V;
 8     int v[1001],val[1001];
 9     int f[1001];
10     int i,N,j;
11     cin>>T;
12     while(T--)
13     {
14         memset(f,0,sizeof(f));
15         cin>>N>>V;
16         for(i=1;i<=N;i++)
17             cin>>val[i];
18         for(i=1;i<=N;i++)
19             cin>>v[i];
20         for(i=1;i<=N;i++)
21         {
22             for(j=V;j>=v[i];j--)
23                 f[j]=max(f[j],f[j-v[i]]+val[i]);
24         }
25         cout<<f[V]<<endl;
26     }
27 }