Bone Collector（裸01背包）

题目链接

题目描述：

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

题解：01背包的模板题

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;

const int MAXN = 1009;
long long dp[MAXN][MAXN] , w[MAXN] , v[MAXN];

int main()
{
    long long T;
    while(cin >> T)
    {
        long long n , s;
        while(T--)
        {
            memset(dp,0,sizeof(dp));
            cin >> n >> s ;
            for(int i = 0 ; i < n ; i ++)
                cin >>v[i];
            for(int i = 0 ; i < n ; i ++)
                cin >> w[i];
            for(int i = n - 1 ; i >= 0 ; i --)
            {
                for(int j = 0 ; j <= s ; j ++)
                {
                    if(j < w[i])
                        dp[i][j] = dp[i+1][j];
                    else
                        dp[i][j] = max(dp[i+1][j],dp[i+1][j-w[i]] + v[i]);
                }
            }
            cout << dp[0][s] << endl;
        }
    }
    return 0 ;
}