HDU 2602 DP大水题 01背包

除了LCS以外过的第一个DP 而且是第一个用一维数组的 DP  题目及AC代码如下

基本的01背包问题的状态转移方程：

Bone Collector

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 25275    Accepted Submission(s): 10244

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

 

#include<stdio.h>
#include<stdlib.h>
#include<string.h>

const int max_n=1010;

int max(int a,int b)
{
    return a>b?a:b;
}

int main(void)
{

    int cases;
    int v[max_n];
    int w[max_n];
    int dp[max_n];
    int N,V;
    scanf("%d",&cases);
    while(cases--)
    {
        memset(dp,0,sizeof(dp));
        scanf("%d%d",&N,&V);
        for(int i=0;i<N;i++)
        {
            scanf("%d",&w[i]);              //value
        }
        for(int i=0;i<N;i++)
        {
            scanf("%d",&v[i]);              //volume
        }
        for(int i=0;i<N;i++)
            for(int vi=V;vi>=v[i];vi--)
                dp[vi]=max(dp[vi],dp[vi-v[i]]+w[i]);

        printf("%d
",dp[V]);
    }
    return 0;
}