Bone Collector

01背包裸题

http://acm.hdu.edu.cn/showproblem.php?pid=2602

Bone Collector Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 47336    Accepted Submission(s): 19746 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 31).   Sample Input 1 5 10 1 2 3 4 5 5 4 3 2 1   Sample Output 14

虽然a+b还是给出dp方程

设dp[i][j]表示前i件物品放入体积为j的背包中获得的最大价值。

dp[i][j]=max(dp[i-1][j],dp[i-1][j-c[i]]+w[i]);

表示第i件物品放入与不放入

//dp500-8
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <string>
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define LL long long
using namespace std;
const int SIZE=1e3+10;
int c[SIZE],w[SIZE],dp[SIZE];
int main()
{
    int T,n,m;
    scanf("%d",&T);
    for(int cas=1;cas<=T;cas++){
        memset(dp,0,sizeof(dp));
        scanf("%d%d",&n,&m);
        for(int i=0;i<n;i++)scanf("%d",&w[i]);
        for(int i=0;i<n;i++)scanf("%d",&c[i]);
        for(int i=0;i<n;i++)
        for(int j=m;j>=c[i];j--){
            dp[j]=max(dp[j],dp[j-c[i]]+w[i]);
        }
        printf("%d\n",dp[m]);
    }
    return 0;
}