杭电2602（01背包）

Bone Collector（难度：1）

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 ?

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

思路：

题意：一共有n块骨头，背包容量为v，每种骨头有一定的价值value和体积volume，每种骨头只有一块，求背包能装下的最大价值。

抽象：01背包，因为每种骨头只有一个。

解决：递推公式：dp[j] = max ( dp[j] , dp[ j - volume [ i ] ] + value[i])。dp[j]为容量为j时的最大价值。

AC代码：

#include <iostream>
#include <cstring>
#include <stack>
using namespace std;

#define INF 0xfffffff
#define maxn 1010

int dp[maxn];
int value[maxn];//价值 
int volume[maxn];//体积 

int main()
{
    int t,n,v;
    cin>>t;//case
    while(t--)
    {
        cin>>n>>v;//骨头数量和包的体积 
        for(int i=0;i<n;i++)
        {
            cin>>value[i];//骨头价值
        }
        for(int i=0;i<n;i++)
        {
            cin>>volume[i];//骨头体积 
        }
        memset(dp,0,sizeof(dp));
        for(int i=0;i<n;i++)
        {
            for(int j=v;j>=volume[i];j--)
            {
                dp[j]=max(dp[j],dp[j-volume[i]]+value[i]);
            }
        }
        cout<<dp[v]<<endl;
    }
    return 0;
}