HDU2602 Bone Collector 【01背包】
来源:互联网 发布:中南民族大学网络教育 编辑:程序博客网 时间:2024/06/05 20:00
Bone Collector
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 28365 Accepted Submission(s): 11562
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背包入门题。
#include <stdio.h>#include <string.h>#define maxn 1002int dp[maxn], w[maxn], v[maxn];int main(){ int t, n, val, i, j; scanf("%d", &t); while(t--){ scanf("%d%d", &n, &val); for(i = 1; i <= n; ++i) scanf("%d", v + i); for(i = 1; i <= n; ++i) scanf("%d", w + i); memset(dp, 0, sizeof(dp)); for(i = 1; i <= n; ++i){ for(j = val; j >= w[i]; --j){ if(dp[j] < dp[j-w[i]] + v[i]) dp[j] = dp[j-w[i]] + v[i]; } } printf("%d\n", dp[val]); } return 0;}
0 0
- Bone Collector hdu2602 01背包
- HDU2602:Bone Collector(01背包)
- hdu2602 bone collector 01背包
- hdu2602 Bone Collector (01背包)
- hdu2602 Bone Collector(01背包)
- HDU2602 Bone Collector 【01背包】
- HDU2602:Bone Collector(01背包)
- hdu2602 01背包Bone Collector
- hdu2602 Bone Collector--01背包
- HDU2602 Bone Collector(01背包)
- hdu2602 Bone Collector(背包)
- hdu2602 Bone Collector(01背包)
- hdu2602 Bone Collector (01背包)
- hdu2602-Bone Collector(01背包模版题)
- HDU2602-Bone Collector-01背包(模板题)
- hdu2602 Bone Collector (01背包)
- hdu2602 Bone Collector(01背包+入门)
- 【HDU2602】Bone Collector(01背包入门级)
- Windows batch脚本总结
- android平台的基础——Dalvik 虚拟机
- 聊聊Service(二)
- 一切从现在开始
- Firefox 里的 Vim(转)
- HDU2602 Bone Collector 【01背包】
- 自动生成android动画配置文件
- Codeforces #257 (Div. 2) C. Jzzhu and Chocolate
- 台风“威马逊”重创广东海南等地
- rtt学习笔记二:I/O设备管理
- android开发常用的java包
- Ubuntu13.10纯文本模式/终端中文乱码解决方法
- 开始读《Unix环境高级编程》
- ffmpeg移植