HDU-2602
来源:互联网 发布:java excel 模板填充 编辑:程序博客网 时间:2024/06/02 03:13
Bone Collector
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 62187 Accepted Submission(s): 25918
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 ?
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.
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
15 101 2 3 4 55 4 3 2 1
Sample Output
14典型的01背包问题:AC代码:#include#include #includeusing namespace std;#define Maxn 1005int dp[Maxn][Maxn];int w[Maxn],v[Maxn];int main(){//freopen("G:\\text.txt","r",stdin);int T;scanf("%d",&T);while(T--){int n,sum;scanf("%d%d",&n,&sum);for(int i=0;i
阅读全文
0 0
- HDU 2602
- HDU 2602
- HDU 2602
- HDU 2602
- hdu 2602
- hdu 2602
- hdu 2602
- HDU 2602
- HDU 2602
- hdu 2602
- HDU 2602
- hdu 2602
- HDU 2602
- HDU 2602
- HDU 2602
- HDU 2602
- hdu 2602
- HDU 2602
- CentOS下 安装与配置Ant (20170707)
- Redis学习笔记三:redis事物及锁的应用
- Go闭包函数
- Redis学习笔记四:redis的持久化
- Windows 某些软件显示"口口"解决办法
- HDU-2602
- HDU-1203
- opencv之深拷贝及浅拷贝,IplImage装换为Mat
- HDU 2102 A计划
- Redis学习笔记五:redis主从复制
- js每日一算法之取最大差值
- 2017.7.06 学习笔记 Servlet-----Session作用域
- Oracle基础总结
- [机器学习入门] 李宏毅机器学习笔记-22(Transfer Learning part 2;迁移学习 part 2)