Bone Collector
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 22298 Accepted Submission(s): 9039
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 ?
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 ?
![](https://i-blog.csdnimg.cn/blog_migrate/0bf307b7a4c44236bd26a289041b24d5.jpeg)
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.
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
解题思路:
基本思路:这是最基础的背包问题,特点是:每种物品仅有一件,可以选择放或不放
求能够放入所有N件商品中体积为V的背包里价值最大和。用二维数组 c[i][j] 表示前 i 件商品中能够放入体积为 j 的背包里价值的最大和,则所求可以表示为 c[n][v] ;
状态转移方程为 c[i][j]=max{ c[i-1][j] , c[i-1][j-w[i]]+p[i] } ;
代码:
#include <iostream>
#define MAXNUM 1005
using namespace std;
int p[MAXNUM]={0},s[MAXNUM]={0},c[MAXNUM][MAXNUM]={0};
int max1(int a,int b)
{
if(a>b)
return a;
else
return b;
}
int main()
{
int t,n,v;
int i,j;
cin>>t;
while(t--)
{
cin>>n>>v;
for(i=1;i<=n;i++)
cin>>p[i];
for(i=1;i<=n;i++)
cin>>s[i];
for(i=s[1];i<=v;i++)
c[1][i]=p[1];
for(i=2;i<=n;i++)
{
for(j=0;j<=v;j++)
{
if(j>=s[i])
{
c[i][j]=max1(c[i-1][j-s[i]]+p[i],c[i-1][j]);
}
else
c[i][j]=c[i-1][j];
}
}
cout<<c[n][v]<<endl;
}
return 0;
}