短学期实践计划//杭电OJ（2602）

**Bone Collector
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 116650 Accepted Submission(s): 46848
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 231).

Sample Input
1
5 10
1 2 3 4 5
5 4 3 2 1

Sample Output
14**

思路：非常经典的0/1背包问题，利用动态规划实现,利用滚动数组储存值，使用递推式dp[j] = max(dp[j],dp[j-w[i]]+v[i])完成.
代码：

#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
#define MAX 1005
int v[MAX],w[MAX],dp[MAX];
int main(){
    int T,N,V;
    cin>>T;
    while(T--){
        cin>>N>>V;
        memset(dp,0,sizeof(dp));
        for(int i=0;i<N;i++)
            cin>>v[i];
        for(int i=0;i<N;i++)
            cin>>w[i];
        for(int i=0;i<N;i++){
            for(int j=V;j>=w[i];j--){
                dp[j] = max(dp[j],dp[j-w[i]]+v[i]);
            }
        }
        cout<<dp[V]<<endl;
    }
    return 0;
}