Hdu2602_bone collector (Backpack/01 backpack)

Solution report

Question Portal

Question:

The size of V and the number of items are N. Each item has value and capacity, and the maximum value that can be loaded into the package is obtained.

Ideas:

Basic 01 backpack.

DP [J] = max (DP [J], DP [J-C [I] + W [I])

#include <iostream>#include <cstring>#include <cstdio>#define inf 99999999using namespace std;int main(){    int t,i,j,n,v,w[1010],c[1010],dp[1010];    scanf("%d",&t);    while(t--) {        memset(dp,0,sizeof(dp));        scanf("%d%d",&n,&v);        for(i=1; i<=n; i++)            scanf("%d",&w[i]);        for(i=1; i<=n; i++)            scanf("%d",&c[i]);        for(i=1; i<=n; i++) {            for(j=v; j>=c[i]; j--) {                dp[j]=max(dp[j],dp[j-c[i]]+w[i]);            }        }        printf("%d\n",dp[v]);    }    return 0;}

Bone Collector Time Limit: 2000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)
Total submission (s): 29249 accepted submission (s): 11967


Problem descriptionpolicyears 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, obviusly, 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?

 
Inputthe first line contain a integer t, the number of instances.
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.
Outputone integer per line representing the maximum of the total value (This number will be less than 231 ).
Sample Input

15 101 2 3 4 55 4 3 2 1

 
Sample output

14

 
Authorteddy
Sourcehdu 1st "vegetable-birds Cup" programming open contest