Bone Collector
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
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 ?
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
Author
Teddy
————————————————————久违的分割线————————————————————
思路:DP01背包问题的模板题。在AOJ解决桂园食堂之前,四处寻找最基础的01背包问题的题目,找到了它。典型的01背包思路。1.储存每个物体的价值 2.储存每个物体的花费 3.在总价值数组f[ ]中储存每次的决策
代码如下:
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
int worth[1005], cost[1005], f[1005];
int main() {
int cas;
scanf("%d", &cas);
while(cas--) {
int n, V;
memset(f, 0, sizeof(f));
scanf("%d%d", &n, &V);
for(int i = 0; i < n; i++)
scanf("%d", worth+i);
for(int i = 0; i < n; i++)
scanf("%d", cost+i);
for(int i = 0; i < n; i++) //枚举每个物体
for(int j = V; j >= cost[i]; j--) //从V->cost[i]做出决策:放或者不放;更新总价值数组f[]
if(f[j-cost[i]]+worth[i] > f[j])
f[j] = f[j-cost[i]]+worth[i];
printf("%d\n", f[V]);
}
return 0;
}