Bone Collector（动态规划-dp-01背包裸题）

Bone Collector（动态规划-dp-01背包裸题）

source：hduoj 2602
Time limit：2000 ms
Memory limit：32768 kB
OS：Windows

描述

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

Sample Input

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

Sample Output

14

题意

你有一个背包，背包有一个最大容量。
你面前有一堆骨头，每个骨头有一定的价值也有一定的体积。
问你如何挑选骨头能使你拿的价值最大化。

01背包模板题不解释。不懂去翻背包九讲。

代码

#include <bits/stdc++.h>
#define maxn 1005
#define inf 0x3f3f3f3f
#define ll long long
#define _for(i, a) for(ll i = 0; i < (a); i++)
#define _rep(i, a, b) for(ll i = (a); i <= (b); i++)
using namespace std;
ll v[maxn], w[maxn];
ll dp[maxn];
ll n, V;
int main() {
	ll T;
	cin >> T;
	_for(Case, T) {
		cin >> n >> V;
		_for(i, n) cin >> v[i];
		_for(i, n) cin >> w[i];
		memset(dp, 0, sizeof(dp));
		_for(i, n) {
			for (ll j = V; j >= w[i]; j--) {
				dp[j] = max(dp[j], dp[j - w[i]] + v[i]);
			}
		}
		cout << dp[V] << "\n";
	}
}