Bone Collector(背包问题dp)

Bone Collector

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)

Total Submission(s) : 29   Accepted Submission(s) : 16

Font: Times New Roman | Verdana | Georgia

Font Size: ← →

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 ³¹).

Sample Input

1
5 10
1 2 3 4 5
5 4 3 2 1

Sample Output

14

dp方程：dp[i][j]=max(dp[i-1][j],dp[i-1][j-V[i]]+f[i]).

二维数组解法：

#include<iostream>
#include<string.h>
using namespace std;
int max(int a,int b)
{
    return a>b?a:b;
}
int f[1001],V[1001],dp[1001][1001];
int main()
{
    int n,m,x,y,i,j,v;
    
    cin>>m;
    while(m--)
    {
        cin>>n>>v;
        for(i=1;i<=n;i++)
            cin>>f[i];
        for(i=1;i<=n;i++)
            cin>>V[i];
        f[0]=V[0]=0;
        memset(dp,0,sizeof(dp));
        for(i=1;i<=n;i++)
            for(j=0;j<=v;j++)
            {
                if(j>=V[i]) dp[i][j]=max(dp[i-1][j],dp[i-1][j-V[i]]+f[i]);
                else dp[i][j]=dp[i-1][j];
            }
                
            cout<<dp[n][v]<<endl;
    }
    return 0;
}

一维数组解法：

#include<iostream>
#include<string.h>
using namespace std;
int max(int a,int b)
{
    return a>b?a:b;
}
int f[1001],V[1001],dp[1001];
int main()
{
    int n,m,x,y,i,j,v;
    
    cin>>m;
    while(m--)
    {
        cin>>n>>v;
        for(i=1;i<=n;i++)
            cin>>f[i];
        for(i=1;i<=n;i++)
            cin>>V[i];
        f[0]=V[0]=0;
        memset(dp,0,sizeof(dp));
        for(i=1;i<=n;i++)
            for(j=v;j>=V[i];j--)
//注意从v~V[i]的顺序求，不至于重叠
            dp[j]=max(dp[j],dp[j-V[i]]+f[i]);
                
            cout<<dp[v]<<endl;
    }
    return 0;
}