杭电OJ2602--------Bone Collector---------01背包

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 2 ³¹).

 

Sample Input

  
  

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

 

Sample Output

  
  

   
   14
  
  

最简单的01背包，用的是优化过的一维数组解法，

关键步骤是

for i=1..N

	for v=V..0

        f[v]=max{f[v],f[v-c[i]]+w[i]};

dev上可以编译通过但是OJ上不可以所以数组定义改为了动态数组

代码 ：

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

int main()
{
	int T;
	cin>>T;
	while(T--)
	{
		int N,V;
		cin>>N>>V;
		vector<int>w(N+1);
		vector<int>c(N+1);
		vector<int>f(V+1,0);
		for(int i=1;i<=N;i++)
			cin>>w[i];    //每个的价值 
		for(int i=1;i<=N;i++)
			cin>>c[i];    //每个占的体积		
		for(int i=1;i<=N;i++)
			for(int v=V;v-c[i]>=0;v--)
			{
				f[v]=max(f[v],f[v-c[i]]+w[i]);
			} 
		cout<<f[V]<<endl;		
	}	
	return 0;
}