第五次个人赛E题 Bone Collector 01背包问题

Bone Collector

HDU 2602 http://acm.hdu.edu.cn/showproblem.php?pid=2602

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

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
  
  
  
  

   
   最简单的背包问题啊····下面贴上我的代码（一维）： 后面还有二维的
  
  
  
  

   
   d[j]表示容量为j 的当前价值  因为装石头是没有次序之分的，因此DP很快做出来
  
  
  
  

   
   #include "algorithm"
#include "iostream"
#include "cmath"
#include "stdio.h"
#include "string.h"
#include "stdlib.h"
using namespace std;

int val[1001],vol[1001],d[1001];

int main(){
    freopen("tin.txt","rt",stdin);
    freopen("tout.txt","wt",stdout);
   int T,n,vma,i,j;
   
   scanf( "%d",&T );   
   while( T-- ) {
   
       memset( d, 0, sizeof(d) );
       scanf( "%d%d", &n, &vma );
       for( i=0; i<n; i++ )   
            scanf( "%d", &val[i] );    //或者用结构体来做 
       for( i=0; i<n; i++ )   
            scanf( "%d", &vol[i] );
            
       for( i=0; i<n; i++ )       
            for( j=vma; j>=vol[i]; j-- )       //必须从大到小， 从小到大会出现重复加同一石头的情况 
                d[j] = max( d[ j-vol[i] ] + val[i], d[j] );
                
       printf( "%d/n", d[vma] );   
   }
   //system("pause");
return 0;    
}
 
  
  
  
  

   
   下面是二维数组做法，跟一维的差不多：
  
  
  
  

   
   #include "algorithm"
#include "iostream"
#include "cmath"
#include "stdio.h"
#include "string.h"
#include "stdlib.h"
using namespace std;
const int MAXN = 1009;
int val[MAXN], vol[MAXN], f[MAXN][MAXN];

int main(){
	int T, n, v;
	scanf("%d", &T);
	while(T--){
		scanf("%d%d", &n, &v);
		int i, j;
		for(i = 1; i <= n; ++i)
			scanf("%d", &val[i]);
		for(i = 1; i <= n; ++i)
			scanf("%d", &vol[i]);
		memset(f, 0, sizeof(f));
		for(i = 1; i <= n; ++i)   //对于前i个物品容量为j能装的最大价值 
			for(j = 0; j <= v; ++j){
				f[i][j] = f[i-1][j];//不装
				if(j-vol[i] >= 0)//装
					f[i][j] = max(f[i][j], f[i-1][j-vol[i]]+val[i]);
			}
		printf("%d/n", f[n][v]);
	}
	return 0;
}