Bone Collector 01背包问题

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

这是我第一次写背包问题，头一天晚上看了很多视频还是一脑子糊涂，到了第二天早上在去研究代码+看视频，就终于懂了，就是动态规划的基本操作，多看看就会懂了，核心代码也就是一下：

for(int i=1; i<=x; i++)//dp[i][j]就是前i件东西在背包容量为j的条件下能装的最大价值
        {
            for(int j=0; j<=y; j++)
            {
                if(j>=b[i])
                    dp[i][j]=dp[i-1][j]>(dp[i-1][j-b[i]]+a[i])?dp[i-1][j]:(dp[i-1][j-b[i]]+a[i]);
                else
                    dp[i][j]=dp[i-1][j];
            }

        }

AC代码：

#include<iostream>
#include<stdio.h>
#include<cstdlib>
#include<string>
#include<string.h>
#include<algorithm>
#include<math.h>
using namespace std;
#include<cstdio>
int a[1005],b[1005];
int dp[1005][1005];
int main()
{
    int N;
    cin>>N;
    while(N--)
    {
        int x,y;
        cin>>x>>y;
        for(int i=1; i<=x; i++)
            cin>>a[i];//价值
        for(int i=1; i<=x; i++)
            cin>>b[i];//所占空间
        for(int i=1; i<=x; i++)
        {
            for(int j=0; j<=y; j++)
            {
                if(j>=b[i])
                    dp[i][j]=dp[i-1][j]>(dp[i-1][j-b[i]]+a[i])?dp[i-1][j]:(dp[i-1][j-b[i]]+a[i]);
                else
                    dp[i][j]=dp[i-1][j];
            }

        }
        cout<<dp[x][y]<<endl;
    }
    return 0;
}