专题三1017

*题意

体积为V的背包，收集不同体积，不同价值的骨头，计算背包能装下的骨头的最大价值。

*思路

很明显是背包问题，原谅我直接用背包问题的解法做了

*源码

#include<iostream>  
#include<string.h>
using namespace std;
    #define M 1009  
    typedef struct pack  
    {  
        int cost;  
        int val;  
    }PACK;  
    int main()  
    {  
        int cas,n,v,i,j;  
        int f[M];  
        PACK a[M];  
        cin>>cas;  
        while(cas--)  
        {  
            cin>>n>>v;  
            memset(f,0,sizeof(f));  
            for(i=1;i<=n;i++)  
               cin>>a[i].val;  
            for(i=1;i<=n;i++)  
                cin>>a[i].cost;  
            for(i=1;i<=n;i++)  
                for(j=v;j>=a[i].cost;j--)  
                    if(f[j]<f[j-a[i].cost]+a[i].val)  
                        f[j]=f[j-a[i].cost]+a[i].val;  
           cout<<f[v]<<endl;  
        }  
        return 0;  
    } 

Problem Q

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)

Total Submission(s) : 63   Accepted Submission(s) : 23

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 …<br>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 ?<br><center><img src=../../../data/images/C154-1003-1.jpg> </center><br>

 

Input

The first line contain a integer T , the number of cases.<br>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
   
   

 

Statistic | Submit | Back