Bone Collector HDU - 2602 动态规划入门

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

AC的C++程序如下:

#include<bits/stdc++.h>
using namespace std;
struct bone
{
	int val,vol;
}b[1005];
int dp[1005][1005];
int main()
{
	int t;
	cin>>t;
	while(t--)
	{
		int n,v;
		cin>>n>>v;
		memset(dp,0,sizeof(dp));
		for(int i=1;i<=n;i++) cin>>b[i].val;
		for(int i=1;i<=n;i++) cin>>b[i].vol;
		for(int i=1;i<=n;i++)
		{
			for(int j=0;j<=v;j++)
			{
				if(b[i].vol>j) dp[i][j]=dp[i-1][j];
				else dp[i][j]=max(dp[i-1][j],dp[i-1][j-b[i].vol]+b[i].val);
			}
		 } 
		 cout<<dp[n][v]<<endl;
	 } 
 }