hdu2602 Bone Collector(01背包)

http://acm.hdu.edu.cn/webcontest/contest_showproblem.php?pid=1003&ojid=0&cid=5510&hide=0

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

15 101 2 3 4 55 4 3 2 1

 

Sample Output

14

分析：

#include <iostream>#include <string.h>#include <stdio.h>using namespace std;int main(){    int T,N,V,str[1001],a[1001],b[1001],tem;    cin>>T;    while(T--)    {        cin>>N>>V;        for(int i=0;i<N;i++)        cin>>b[i];        for(int i=0;i<N;i++)        cin>>a[i];        memset(str,0,sizeof(str));        for(int i=0;i<N;i++)        {            for(int j=V;j>=a[i];j--)            {                tem=str[j-a[i]]+b[i];                if(str[j]<tem)                str[j]=tem;            }        }        cout<<str[V]<<endl;    }    return 0;}

或许下面这一个会更明白一些

另：

#include<stdio.h>#include <string.h>int weight[1010];int value[1010];int dp[1010];int max(int a,int b){    return a>b?a:b;}int main(){    int T;    int N,V;    int sum;    int tem;    scanf("%d",&T);    while(T--)    {        sum=0;        scanf("%d%d",&N,&V);        for(int i=0; i<N; i++)            scanf("%d",&value[i]);        for(int i=0; i<N; i++)        {            scanf("%d",&weight[i]);        }            memset(dp,0,sizeof(dp));        for(int k=0; k<N;k++)            for(int j=V;j>=weight[k];j--)            {                dp[j]=max(dp[j],dp[j-weight[k]]+value[k]);            }            printf("%d\n",dp[V]);    }    return 0;}