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

ACM Bone Collector

时间:2017-08-13 11:14:54      阅读:156      评论:0      收藏:0      [点我收藏+]

标签:bag   value   vol   port   htm   different   cout   content   i++   

 
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 ? 
技术分享
InputThe 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.OutputOne integer per line representing the maximum of the total value (this number will be less than 2 31).Sample Input
1
5 10
1 2 3 4 5
5 4 3 2 1
Sample Output
14
 1 #include<bits/stdc++.h>
 2 using namespace std;
 3 int main()
 4 {
 5     int dp[1005],n,v,nv[1005],nm[1005],t;
 6     while(cin>>t)
 7     {
 8         while(t--)
 9         {
10             memset(dp,0,sizeof(dp));  /*初始化*/
11             scanf("%d %d",&n,&v);         /*读取骨头数量和背包重量*/
12             for(int i = 0; i < n; i++)  /*每一个骨头的价值*/ 
13                 scanf("%d",&nv[i]);
14             for(int i = 0; i < n; i++)    /*每个骨头的重量*/ 
15                 scanf("%d",&nm[i]);
16                 
17             for(int i = 0; i < n; i++)
18                 for(int j = v; j >= nm[i];j--)  /*dp算法*/ 
19                     dp[j] = max(dp[j],dp[j-nm[i]]+nv[i]);
20             cout<<dp[v]<<endl;
21         }
22     }
23 
24  return 0;
25 }

 

 参考博客: 

ACM Bone Collector

标签:bag   value   vol   port   htm   different   cout   content   i++   

原文地址:http://www.cnblogs.com/jj81/p/7287397.html

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