hdu -2602（01背包DP）Bone Collector

Bone Collector


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




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 231).
 


Sample Input
1
5 10
1 2 3 4 5
5 4 3 2 1
 


Sample Output
14
 


Author
Teddy

 

题意：输入t，代表有t组测试数据。

接下来输入骨头的数量n,还有背包的体积v（volume）,

输入每个骨头的价值value

输入骨头的体积volume

求出在满足不超过背包体积的情况下，所获得的最大体积。

典型的01背包问题，可以使用状态转移方程：

dp[j]=max(dp[j],dp[j-volume[i]]+value[i]);

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
int dp[1009];
using namespace std;
int main()
{
    int t,N,V;
    int value[1100],volume[1100];
    scanf("%d",&t);
    while(t--)
    {
        int i,j;
        memset(dp,0,sizeof(dp));
        scanf("%d%d",&N,&V);
        for(i=1;i<=N;i++)
        {
             scanf("%d",&value[i]);
             //sum+=value[i];
        }
        for(i=1;i<=N;i++)
             scanf("%d",&volume[i]);
        for(i=1;i<=N;i++)
            for(j=V;j>=volume[i];j--)
               // if(dp[j]<dp[j-volume[i]]+value[i])
                //    dp[j]=dp[j-volume[i]]+value[i];
                dp[j]=max(dp[j],dp[j-volume[i]]+value[i]);
        printf("%d\n",dp[V]);
    }
    return 0;
}