hdu 2602--Bone Collector(01背包)
2015-09-23 20:07
344 查看
[align=left]Problem Description[/align]
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 ?
![](http://acm.hdu.edu.cn/data/images/C154-1003-1.jpg)
[align=left]Input[/align]
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.
[align=left]Output[/align]
One integer per line representing the maximum of the total value (this number will be less than 231).
[align=left]Sample Input[/align]
1
5 10
1 2 3 4 5
5 4 3 2 1
[align=left]Sample Output[/align]
14
[align=left]01背包:[/align]
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 ?
![](http://acm.hdu.edu.cn/data/images/C154-1003-1.jpg)
[align=left]Input[/align]
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.
[align=left]Output[/align]
One integer per line representing the maximum of the total value (this number will be less than 231).
[align=left]Sample Input[/align]
1
5 10
1 2 3 4 5
5 4 3 2 1
[align=left]Sample Output[/align]
14
[align=left]01背包:[/align]
#include <stdio.h> #include <stdlib.h> #include <string.h> #include <math.h> #include <algorithm> #include <iostream> using namespace std; int dp[10000]; int main() { int t,i,j,n,v; scanf("%d",&t); while(t--){ int a[10000]; int b[10000]; memset(dp,0,sizeof(dp)); scanf("%d%d",&n,&v); for(i=1;i<=n;i++) scanf("%d",&a[i]); for(i=1;i<=n;i++) scanf("%d",&b[i]); for(i=1;i<=n;i++){ for(j=v;j>=b[i];j--){ dp[j]=max(dp[j],dp[j-b[i]]+a[i]); } } printf("%d\n",dp[v]); } return 0; }
相关文章推荐
- FocusChange-焦点变化监听事件
- LeetCode(86) Partition List
- Ubuntu服务器安装mysql数据库
- 【DIV+CSS】代码作业练习DIV+CSS太极阴阳图
- “新建Laravel项目”并“开启laravel”的操作
- 安卓:WebView简单使用
- UVA592字符串推断题加暴力假设搜索
- AVS2高清实时编码器问世,性能大幅超越HEVC/H.265编码器x265
- leetcode刷题,总结,记录,备忘 118
- Altium Designer 14 安装完整元件库
- Codeforces Round #321 A Kefa and First Steps
- iOS-APP发布应注意
- BaseDao的设计思路---接口编程
- Android自定义软键盘输入法,隐藏系统输入法显示光标的实现
- 优化UITableViewCell高度计算的那些事
- 高效程序员的 7 个共同特征
- poj2187(最远点的距离的平方)
- 使用Android Studio时的一个问题
- iOS-App上架流程
- xml直接读取节点