Bone Collector HDOJ-2602 (基本01背包)
http://acm.hdu.edu.cn/showproblem.php?pid=2602
Bone Collector
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 26807 Accepted Submission(s): 10848
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 ?
![](http://acm.hdu.edu.cn/data/images/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.
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
代码如下:
#include<iostream>
#include<cstring>
#include<algorithm>
#define maxn 1005
using namespace std;
int dp[maxn],Cost[maxn],Val[maxn];
int n,sum;
void zeroonepack(int cost,int value)
{
for(int i=sum;i>=cost;i--)
{
if(dp[i-cost]+value>dp[i])
dp[i]=dp[i-cost]+value;
}
}
int main()
{
int t,i;
scanf("%d",&t);
while(t--)
{
memset(dp,0,sizeof dp);
scanf("%d%d",&n,&sum);
for(i=1;i<=n;i++)
scanf("%d",&Val[i]);
for(i=1;i<=n;i++)
scanf("%d",&Cost[i]);
for(i=1;i<=n;i++)//有n个数
{
zeroonepack(Cost[i],Val[i]);
}
printf("%d\n",dp[sum]);
}
return 0;
}