hdoj 2602 Bone Collector【0-1背包】【dp思想】
来源:互联网 发布:php单选框提交 编辑:程序博客网 时间:2024/04/24 19:50
Bone Collector
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 40247 Accepted Submission(s): 16722
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<stdio.h>#include<string.h>#include<algorithm>using namespace std;struct node{int value,vol;}; node p[1010];int bag[1100];int main(){int i,j,k,t,n,v;scanf("%d",&t);//总情况数 while(t--){memset(bag, 0, sizeof(bag));//全初始化为 0 scanf("%d%d",&n,&v);//n数量,v体积 for(i = 1; i <= n; i++)scanf("%d",&p[i].value);//输入每个骨头的价值 for(i = 1; i <= n; i++)scanf("%d",&p[i].vol);//输入每个骨头所占体积 for(i = 1; i <= n ;i++)//数量变化 {for( j = v; j >= p[i].vol;j--)// 体积控制,背包如果可以装下骨头就继续 {//动态规划过程 bag[j] = max(bag[j], bag[j-p[i].vol]+p[i].value);//当前与下一个取价值最大的 }}printf("%d\n",bag[v]);//输出装的最多价值 }return 0;}
0 0
- hdoj 2602 Bone Collector【0-1背包】【dp思想】
- HDOJ 2602 Bone Collector 【0 1背包】
- HDOJ 2602 Bone Collector(0-1背包)
- HDOJ--2602--Bone Collector--dp--01背包
- HDOJ-2602 Bone Collector(背包DP)
- dp (0,1背包)Bone Collector HDOJ-2602 (基本01背包)
- HDU/HDOJ 2602 Bone Collector(DP,0/1背包,贪心,经典题目)
- HDOJ Bone Collector (0/1背包)
- HDOJ 2602 Bone Collector(0-1背包)
- hdoj 2602 Bone Collector (0-1)背包
- hdoj 2602 Bone Collector【裸0-1背包】
- HDOJ 2602 Bone Collector 0-1背包问题的最简形
- HDOJ-----2602Bone Collector(DP-----01背包)
- HDOJ(HDU).2602 Bone Collector (DP 01背包)
- hdu 2602 Bone Collector 简单dp题 0-1背包
- HDOJ 2602 Bone Collector 01背包问题
- HDOJ 2602 Bone Collector (01背包)
- HDOJ 2602 Bone Collector (01背包)
- ImageView全屏
- linker command failed
- Item 13:使用对象(智能指针)来管理资源 Effective C++笔记
- MongoDB Query 的几个方法
- Android反编译工具及用法
- hdoj 2602 Bone Collector【0-1背包】【dp思想】
- 对于不返回任何键列信息的 SelectCommand,不支持 UpdateCommand 的动态 SQL 生成
- objc_msgSend crash
- 取两数间的随机数
- 从设计创业明星 Quirky 的倒掉看硬件创业
- SpringMVC Controller 介绍
- poj3659 Cell Phone Network(最小支配集-树形dp)
- Servlet 工作原理解析
- c3p0连接超时解决方案