Bone Collector （01背包）

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

题意：有很多体积不同价值也不同的骨头，一个人有一个体积为V的背包，问装进背包的骨头的最大价值。

此题是明显的01背包问题（骨头数量无限）

思路：01背包，DP

AC代码：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
#include<queue>
#include<set>
#include<stack>
#include<map>
#include<vector>
#include<cstdlib>
using namespace std;
#define ll long long
int w[1005]; //重量
int v[1005];  //价值
int dp[1005];
int main()
{
    int t,n,m;
    scanf("%d",&t);
    while(t--){
        memset(w,0,sizeof(w));
        memset(v,0,sizeof(v));
        memset(dp,0,sizeof(dp));   //开始要清空
        scanf("%d%d",&n,&m);
        for(int i=1;i<=n;i++)
            scanf("%d",&v[i]);
        for(int i=1;i<=n;i++)
            scanf("%d",&w[i]);
        for(int i=1;i<=n;i++){        //第i个骨头
            for(int j=m;j>=0;j--){    // 从最大容量往回找
                if(w[i]<=j)
                dp[j]=max(dp[j],dp[j-w[i]]+v[i]);  //转移方程  分两种情况：1不放为fp[j],2放dp[j-w[i]]+v[i]
            }
        }
        printf("%d\n",dp[m]);
    }
    return 0;
}