C - Bone Collector（01背包DP基础）

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
思路：
先输入一个t，代表有t个样例。然后输入n和v，n代表有多少骨头。v代表背包体积，每样东西仅仅有一个，也就是说仅仅能取一次，刚開始看这道题的时候全然不知道怎么做。感觉会非常麻烦的样子，学长是作为例题给我们讲的。刚開始有点头绪，但详细还是全然不懂。后来自己专门刷这方面的专题。还算理解的比較好。动态规划的思想得要理解好，这题是用空间换时间。过程中会产生大量之间数据，嗯，就是这样。好了，回到这道题。我们用一维数组来存储数据，可是有些pdf文档比方背包九讲就是用二维数组来解说，都能够的。
如今进入正题：输入前面讲过了，如今讲核心代码

for(i=1;i<=n;i++）
           for(j=m;j>=volume[i];j--）
               over[j]=max(over[j],over[j-volume[i]]+value[i]);

这三行就是核心。就像背包九讲里面说的，这个状态转移方程很重要，一定要理解，它联系了上一个状态和这一个状态，所以叫做状态转移方程！

AC完整代码
#include<iostream>
#include<deque>
#include<memory.h>
#include<stdio.h>
#include<map>
#include<string>
#include<algorithm>
#include<vector>
#include<math.h>
#include<stack>
#include<queue>
#include<set>
#define inf 1<<29
#define maxn 1005
using namespace std;

int over[maxn];
int volume[maxn];
int value[maxn];
int main()
{
   int t;
   scanf("%d",&t);
   while(t--)
   {
       int n,m,i,j;
       scanf("%d%d",&n,&m);
       memset(value,0,sizeof(value));
       memset(volume,0,sizeof(volume));
       memset(over,0,sizeof(over));
       for(i=1;i<=n;i++)
        scanf("%d",&value[i]);
       for(i=1;i<=n;i++)
        scanf("%d",&volume[i]);
       for(i=1;i<=n;i++)
       {
           for(j=m;j>=volume[i];j--)
           {
               over[j]=max(over[j],over[j-volume[i]]+value[i]);

           }
       }
       printf("%d\n",over[m]);
   }
   return 0;
}