SDAU 课程练习3 1017

Problem Q

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

Total Submission(s) : 7   Accepted Submission(s) : 3

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
  
  

 

题目大意：

从前有个大怪兽，他去别的地方偷吃东西，他带了一个大袋子去吃东西。每个事物有一个价值和一个容量。

现在不让你去打小怪兽，而是让你去帮助小怪兽决策，怎样选择物品才能获得最大的价值。

思路：

基础的 0 1 背包的问题，对不对？

感想：

这里的问题理解了很久，从二维到 一维的优化，大家如果不理解。完全可以自己模拟这装一遍，模拟一遍就知道为什么了。

AC代码：

#include <iostream>
#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<cmath>
#include<cstdio>
using namespace std;
int main()
{
    //freopen("r.txt","r",stdin);
    int T,n,Vol,i,j;
    int a;
    cin>>T;
    while(T--)
    {
        scanf("%d%d",&n,&Vol);
        int val[1005];
        int vol[1005];
        int dp[1005];
        for(i=1;i<=n;i++)
        {
            scanf("%d",&val[i]);
        }
        for(i=1;i<=n;i++)
        {
            scanf("%d",&vol[i]);
        }
        memset(dp,0,sizeof(dp));
        for(i=1;i<=n;i++)
        {
            for(j=Vol;j>=vol[i];j--)
            {
                dp[j]=max(dp[j],dp[j-vol[i]]+val[i]);
            }
         //   cout<<dp[i]<<endl;
        }
        cout<<dp[Vol]<<endl;
    }
}