Bone Collector
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 41023 Accepted Submission(s): 17078
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 2
31).
Sample Input
1 5 10 1 2 3 4 5 5 4 3 2 1
Sample Output
14题目大意:搜集骨头的老头有个容量 V 的背包,已知有N个骨头,每个骨头的价值和体积分别为 v[i]和w[i].问老头搜集的骨头最大价值数是多少?解题思路:01背包问题,直接用01背包解决。代码:#include<stdio.h> #include<string.h> int max(int x,int y) { if(x>y) return x; else return y; } struct node{ int v,w; }a[1010]; int dp[1010][1010]; int main() { int t; int V,N,i,j; scanf("%d",&t); while(t--) { memset(a,0,sizeof(a)); scanf("%d%d",&N,&V); for(i=0;i<N;i++) scanf("%d",&a[i].v); for(i=0;i<N;i++) scanf("%d",&a[i].w); memset(dp,0,sizeof(dp)); for(i=N-1;i>=0;i--) { for(j=0;j<=V;j++) { if(j<a[i].w) dp[i][j]=dp[i+1][j]; else dp[i][j]=max(dp[i+1][j],dp[i+1][j-a[i].w]+a[i].v); } } printf("%d\n",dp[0][V]); } return 0; }