（简单01背包）HDU2602

#include<iostream>#include<stdlib.h>#include<math.h>#include<stdio.h>#include<algorithm>#include<queue>#include<string.h>#include<stack>#include<math.h>#include<stdlib.h>#include<list>#include<vector>using namespace std;int n;int V;int v[1001];int price[1001];int volume[1001];int main(){    int i,j,k;    int t;    cin>>t;    while (t--)    {        cin>>n>>V;        for (i=1;i<=n;i++)            cin>>price[i];        for (i=1;i<=n;i++)            cin>>volume[i];        memset(v,0,sizeof(v));        for (i=1;i<=n;i++)        {            for (j=V;j>=volume[i];j--)                v[j]=max(v[j],v[j-volume[i]]+price[i]);        }        cout<<v[V]<<endl;    }    return 0;}

刚开始一直WA，，后来才看到是数组开小了，HDU真坑爹，居然不提示Runtime Error.。还有就是要注意到物品的容量为零时也可能有价值。

Bone Collector

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 11007    Accepted Submission(s): 4244

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 ?

 

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.

 

Output

One integer per line representing the maximum of the total value (this number will be less than 2³¹).

 

Sample Input

15 101 2 3 4 55 4 3 2 1

 

Sample Output

14

 

Author