Bone Collecters——HDU2602（01背包/动态规划）

1.问题

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

2.题目分析

01背包01 背包问题特点是：每种物品仅有一件，可以选择放或不放。用子问题定义状态：即F[i;v] 表示前i 件物品

恰放入一个容量为v的背包可以获得的最大价值。则其状态转移方程便是：
F[i;v] = max（F[i-1;v] ; F[i-1;v-Ci] + Wig）
这个方程非常重要，基本上所有跟背包相关的问题的方程都是由它衍生出来的。所以有必要将它详细解释一下：

“将前i 件物品放入容量为v的背包中”这个子问题，若只考虑第i 件物品的策略（放或不放），那么就可以转化为一个只和前i-1件物品相关的问题。

如果不放第i 件物品，那么问题就转化为“前i-1件物品放入容量为v的背包中”，价值为F[i-1; v]；

如果放第i 件物品，那么问题就转化为“前i-1件物品放入剩下的容量为v-Ci 的
背包中”，此时能获得的最大价值就是F[i-1;v-Ci] 再加上通过放入第i 件物品获得的价值Wi。
————————————————
参考ACM 杭电hdu 2602 Bone Collector（01背包）

3.代码

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

int Max(int a,int b)
{
	return a>b?a:b;
} 
int f[1001][1001];

int main()
{
	int t,n,v;//the number of cases,bones,,,volumn
	int N[1001],V[1001];//每个骨头的价值和体积
	cin>>t;
	while(t--)
	{
		cin>>n>>v;//the number of cases
		for(int i=1;i<=n;i++)
		{
			cin>>N[i];//价值 
		}
		for(int i=1;i<=n;i++)
		{
			cin>>V[i];//体积 
		}
		memset(f,0,sizeof(f));//把f数组清零
		
		for(int i=1;i<=n;i++){
			for(int j=0;j<=v;j++){
				if(j>=V[i])//可放进
					f[i][j]=Max(f[i-1][j],f[i-1][j-V[i]]+N[i]);
				else f[i][j]=f[i-1][j];//放不进 
			}
		}
		cout<<f[n][v]<<endl;
    }
	return 0;
}