hdu 2602 简单的01背包

 

Bone Collector

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

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
   
   
   
   

 

Author

Teddy

 

直接 献上模版！！！

View Code

Problem : 2602 ( Bone Collector )     Judge Status : Accepted
RunId : 17009200    Language : G++    Author : 1136242673
Code Render Status : Rendered By HDOJ G++ Code Render Version 0.01 Beta

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<queue>
#include<cctype>
#define max(a,b)(a>b?a:b)
#define min(a,b)(a<b?a:b)
#define INF 0x3f3f3f3f
 using namespace std; int va[1100],vo[1100]; int dp[1100]; int main() { int T,n,v,i,j;
    scanf("%d",&T); while(T--) {
        scanf("%d%d",&n,&v); for(i=0;i<n;i++)
            scanf("%d",&va[i]); for(i=0;i<n;i++)
            scanf("%d",&vo[i]);

        memset(dp,0,sizeof(dp)); for(i=0;i<n;i++) { for(j=v;j>=vo[i];j--) {
                dp[j]=max(dp[j],dp[j-vo[i]]+va[i]); } }
      printf("%d\n",dp[v]); } return 0; }

View Code

Problem : 2602 ( Bone Collector )     Judge Status : Accepted
RunId : 16434597    Language : G++    Author : 1136242673
Code Render Status : Rendered By HDOJ G++ Code Render Version 0.01 Beta

#include<stdio.h>
#include<string.h>
#define max(a,b)(a>b?a:b)
#define maxn 1005
int dp[maxn][maxn]; int main() { int T, V, N, vo[maxn], va[maxn], i,j;
    scanf("%d",&T); while(T--) {
        scanf("%d%d",&N,&V); for(i=1;i<=N;i++)
          scanf("%d",&va[i]); for(i=1;i<=N;i++)
          scanf("%d",&vo[i]);
        
        memset(dp,0,sizeof(dp)); for( i=1;i<=N;i++) { for( j=0;j<=V;j++) { if(j>=vo[i])
                dp[i][j]=max(dp[i-1][j],dp[i-1][j-vo[i]]+va[i]); else
                dp[i][j]=dp[i-1][j]; } }
        printf("%d\n",dp[N][V]); } return 0; }