动态规划-骨头收集者（一维数组，二维数组）

杭州电子科技大学骨头收集者

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

代码

#include <iostream>

using namespace std;
int w[1010],v[1010];
int t;
int n,V;
int dp[1010][1010];
int  d[1010];
void input()
{
    cin>>n>>V;
    for(int i=1;i<=n;i++)
    {
        cin>>v[i];
    }
    for(int i=1;i<=n;i++)
    {
        cin>>w[i];
    }
}
void DP()
{
    for(int i=0;i<=V;i++)
        dp[0][i]=0;
    for(int i=1;i<=n;i++)
        for(int j=0;j<=V;j++)
        if(j>=w[i])dp[i][j]=max(dp[i-1][j],dp[i-1][j-w[i]]+v[i]);
        else dp[i][j]=dp[i-1][j];
    cout<<dp[n][V]<<endl;
}
void D()
{
    for(int i=0;i<=V;i++)
        d[i]=0;
    for(int i=1;i<=n;i++)
        for(int j=V;j>=w[i];j--)
       d[j]=max(d[j],d[j-w[i]]+v[i]);

    cout<<d[V]<<endl;
}
int main()
{
    cin>>t;
    while(t)
    {
        input();
        D();
        //DP();
        t--;
    }

    return 0;
}
/**
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
*/