HDU 2602 Bone Collector(0-1背包模板题)

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2602

Bone Collector

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

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
  
  

0-1背包模板题

#include<iostream>
#include<cstring>
using namespace std;
const int maxn=100005,inf=1<<30;
int w[maxn],v[maxn],W,n,dp[maxn];
void ZeroOnePack(int weight,int value)
{
    for(int i=W;i>=weight;i--)
        dp[i]=max(dp[i],dp[i-weight]+value);
}
void CompletePack(int weight,int value)
{
    for(int i=weight;i<=W;i++)
        dp[i]=min(dp[i],dp[i-weight]+value);
}
void MultiplePack(int weight,int value,int cnt)
{
    if(weight*cnt>=W) CompletePack(weight,value);
    else
    {
        for(int k=1;k<cnt;k<<=1)
            ZeroOnePack(k*weight,k*value),cnt-=k;
        ZeroOnePack(cnt*weight,cnt*value);
    }
}
int main()
{
    int t,v1,v2;
    cin>>t;
    while(cin>>n>>W)
    {
        for(int i=0;i<n;i++) cin>>v[i];
        for(int i=0;i<n;i++) cin>>w[i];
        fill(dp,dp+maxn,0);
        for(int i=0;i<n;i++) ZeroOnePack(w[i],v[i]);
        cout<<dp[W]<<endl;
    }
    return 0;
}