HDU2602 Bone Collector(DP)
来源:互联网 发布:vr开发用什么编程语言 编辑:程序博客网 时间:2024/04/28 21:28
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
背包问题中基础的题型(还是难啊……)
#include <iostream>#include <cstdio>#include <algorithm>using namespace std;int bone[1005][2];int value[1005];int main(){int t, n, v;cin >> t;while (t--){cin >> n >> v;memset(value, 0, sizeof(value));for (int i = 0; i < n; i++)scanf_s("%d", &bone[i][0]);for (int i = 0; i < n; i++)scanf_s("%d", &bone[i][1]);for (int i = 0; i < n; i++)for (int j = v; j >= 0; j--)if (j >= bone[i][1])value[j] = max(value[j], value[j - bone[i][1]] + bone[i][0]);cout << value[v] << endl;}return 0;}
"There is no certainty, only opportunity."
0 0
- HDU2602 Bone Collector(DP)
- Bone Collector hdu2602(经典dp)01背包
- hdu2602-Bone Collector (背包)
- hdu2602(背包)Bone Collector
- hdu2602 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背包)
- HDU2602 Bone Collector(01背包)
- HDU2602-Bone Collector(01背包)
- HDU2602 Bone Collector
- 使用ABAP指针来计算账龄
- python3 爬虫学习——2
- Codeforces Round #302 (Div. 2) D
- 经典视觉跟踪算法TLD的剖析与展示
- 基于hadoop2.7.3搭建多机环境(YARN+HA)
- HDU2602 Bone Collector(DP)
- 虚拟机性能监控与故障处理工具
- c++第二次实验-7完数输出
- MySQL-Rank Scores
- Hcatalog (表和底层数据管理统一服务平台) 基础概念
- 转:什么是ValueStack
- Java基础(五)OOP面向对象之(一) 面向对象思想初识
- PAT甲级1127
- JS实现进制转换