hdu 2602 Bone Collector 01背包问题
来源:互联网 发布:拓普康全站仪导出数据 编辑:程序博客网 时间:2024/06/06 03:19
Bone Collector
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 66766 Accepted Submission(s): 27874
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
Author
Teddy
Source
HDU 1st “Vegetable-Birds Cup” Programming Open Contest
#include<iostream>#include<algorithm>using namespace std;#define size 1010//细节 题目要求最大值2的31次方 使用unsigned intunsigned int volume[size], value[size];unsigned int dp[size];int main() {int test, n, v;cin >> test;while (test--) {while (cin >> n >> v) {memset(dp, 0, sizeof(dp));for (int i = 0; i < n; i++) {cin >> value[i];}for (int i = 0; i < n; i++) {cin >> volume[i];}//关键for (int i = 0; i < n; i++) {for (int j = v; j >= volume[i]; j--) {//背包问题的状态转移方程dp[j] = max(dp[j], dp[j - volume[i]] + value[i]);}}cout << dp[v] << endl;}}}
阅读全文
0 0
- HDU 2602Bone Collector (01背包问题)
- hdu 2602 Bone Collector 01背包问题
- HDU 2602 Bone Collector 背包问题
- hdu 01背包问题 Bone Collector
- HDU-Bone Collector(01背包问题)
- bone collector hdu 01背包问题
- hdu 2602 Bone Collector (01 背包问题)
- 01背包问题之HDU——2602 Bone Collector
- hdu 2602 Bone Collector(01背包问题)
- HDU 2602 Bone Collector(01背包问题)
- HDU 2602 Bone Collector (01背包问题 基础)
- HDU 2602|Bone Collector|裸01背包问题
- HDU 2602 Bone Collector(01背包问题)
- hdu 2602 (01 背包)Bone Collector
- hdu 2602 Bone Collector 01背包
- hdu 2602 Bone Collector 01背包
- hdu 2602 Bone Collector (01背包)
- hdu 2602 Bone Collector【01背包】
- linux 远程工具
- 桥接模式
- 216. Combination Sum III
- PAT 1118. Birds in Forest (25) 并查集
- pww特征提取算法,图像领域新的技术革命
- hdu 2602 Bone Collector 01背包问题
- css3动画以及过渡
- JavaScript复合类型、运算符、流程控制、异常处理、对象和内建类
- mybatis 里面 字段不能重复重复要用别名
- 图论面试题精讲
- 挑战程序竞赛系列(57):4.6数列上的分治法
- ubuntu安装和查看已安装
- 批量复制文件并改成有顺序的文件名
- 地平线宣讲会+笔试