HDU 2602 Bone Collector

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

题目比较简单，学过01背包的都应该能过

   
   

    
    

     
     
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<vector>
#include<cmath>
#include<stdlib.h>
#include<iomanip>
#include<list>
#include<deque>
#include<map>
#include <stdio.h>
#include <queue>

#define maxn 10000+5
#define ull unsigned long long
#define ll long long
#define reP(i,n) for(i=1;i<=n;i++)
#define rep(i,n) for(i=0;i<n;i++)
#define cle(a) memset(a,0,sizeof(a))
#define mod 90001
#define PI 3.141592657
const ull inf = 1LL << 61;
const double eps=1e-5;
using namespace std;

bool cmp(int a,int b){
    return a>b;
}

int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    int t;cin>>t;
    int n,v;int value[1002],vol[1002];int dp[1002];
    while(t--)
    {   cle(dp);
        cin>>n>>v;
        for(int i=1;i<=n;i++)
            cin>>value[i];
        for(int i=1;i<=n;i++)
            cin>>vol[i];
        for(int j=1;j<=n;j++)
            for(int k=v;k>=vol[j];k--)
             dp[k]=max(dp[k],dp[k-vol[j]]+value[j]);
           cout<<dp[v]<<endl;
    }
    return 0;
}

     
     

      
      

     
     
    
    
   
   

下面是没做空间优化的

#include<iostream>
#include<string>
#include<string.h>
#include<stdio.h>
#define INF 1<<30
using namespace std;
int n,V;
int w[1100],v[1100];
int dp[1100][1100];
int main(){
	#ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
    #endif
    int t;
    cin>>t;
    while(t--){
		cin>>n>>V;
		for(int i=1;i<=n;i++)
			cin>>w[i];
		for(int i=1;i<=n;i++)
			cin>>v[i];
			memset(dp,0,sizeof dp);
		for(int i=1;i<=n;i++)
		for(int j=0;j<=V;j++){
			if(j<v[i])dp[i][j]=dp[i-1][j];
			else{
				dp[i][j]=max(dp[i-1][j],dp[i-1][j-v[i]]+w[i]);
			}
		}
		cout<<dp[n][V]<<endl;
    }
	return 0;
}