HDU2602 Bone Collector

                                                                                                                     点击打开题目链接

Bone Collector

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

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

  
  

   
   1
5 10
1 2 3 4 5
5 4 3 2 1
  
  

 

Sample Output

  
  

   
   14
  
  

 

题解：动态规划 dp[j]=max{dp[j],dp[j-volume[i]]+value[i]}；

AC code：

#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
using namespace std;
#define max(a,b) a>b?a:b
struct Node
{
    int vol;
    int val;
};
int main()
{
    Node p[10001];
    int t,n,v,i,j,dp[10001];
    while(cin>>t)
    {
        while(t--)
        {

            cin>>n>>v;
            for(i=0; i<n; i++)
            {
                cin>>p[i].val;
            }
            for(i=0; i<n; i++)
            {
                cin>>p[i].vol;
            }
            memset(dp,0,sizeof(dp));
            for(i=0; i<n; i++)
                for(j=v; j>=p[i].vol; j--)
                {
                    dp[j]=max(dp[j],dp[j-p[i].vol]+p[i].val);
                }
            cout<<dp[v]<<endl;
        }
    }
    return 0;
}