码迷,mamicode.com
首页 > 其他好文 > 详细

hdu 2602--Bone Collector

时间:2015-09-23 21:18:03      阅读:214      评论:0      收藏:0      [点我收藏+]

标签:

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 231).
 

 

Sample Input
1 5 10 1 2 3 4 5 5 4 3 2 1
 

 

Sample Output
14
 

 

01背包:
 1 #include <stdio.h>
 2 #include <stdlib.h>
 3 #include <string.h>
 4 #include <math.h>
 5 #include <algorithm>
 6 #include <iostream>
 7 using namespace std;
 8 int dp[10000];
 9 
10 int main()
11 {
12     int t,i,j,n,v;
13     scanf("%d",&t);
14     while(t--){
15         int a[10000];
16         int b[10000];
17         memset(dp,0,sizeof(dp));
18         scanf("%d%d",&n,&v);
19         for(i=1;i<=n;i++)
20             scanf("%d",&a[i]);
21         for(i=1;i<=n;i++)
22             scanf("%d",&b[i]);
23         for(i=1;i<=n;i++){
24             for(j=v;j>=b[i];j--){
25                 dp[j]=max(dp[j],dp[j-b[i]]+a[i]);
26             }
27         }
28         printf("%d\n",dp[v]);
29     }
30     return 0;
31 }

 

 

 

hdu 2602--Bone Collector

标签:

原文地址:http://www.cnblogs.com/wangmengmeng/p/4833400.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!