Bone Collector(基础01背包，板子)

Bone Collector(基础01背包，板子)

题目链接：https://vjudge.net/contest/429740#problem/A
这道题是纯板子题，套用01背包优化后的板子即可。
核心代码：

for(int i=1;i<=n;i++)
		{
			for(int j=m;j>=weight[i];j--)
			{
				f[j]=max(f[j],f[j-weight[i]]+value[i]);
			}
	}	

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

下面是题解

#include<stdio.h>
#include<iostream>
#include<string.h>
#include<algorithm>
#define int long long
using namespace std;
int value[10010],weight[10010];
int f[10010];
int n,m;
void knapsack(){

		for(int i=1;i<=n;i++)
		{
			for(int j=m;j>=weight[i];j--)
			{
				f[j]=max(f[j],f[j-weight[i]]+value[i]);
			}
	}	
}
signed main()
{
	int t;
	cin>>t;
	while(t--)
	{
	//	int n,m;
		cin>>n>>m;
		memset(value,0,sizeof(value));
		memset(weight,0,sizeof(weight));
		memset(f,0,sizeof(f));
		for(int i=1;i<=n;i++)
		{
			scanf("%lld",&value[i]);
		}
		for(int i=1;i<=n;i++)
		{
			scanf("%lld",&weight[i]);
		}
		knapsack();
		cout<<f[m]<<endl;
	}
	return 0;
}