典型背包问题
来源:互联网 发布:知乎立升净水器好不好 编辑:程序博客网 时间:2024/05/17 23:42
Bone Collector
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10199 Accepted Submission(s): 3905
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
1
5 10
1 2 3 4
5 5 4 3 2 1
Sample Output
14
#include<iostream>#include<cstring>#include<cstdio>using namespace std;#define maxn(a,b) (a>b?a:b)int dp[1001],vol[1001],val[1001];int main(){ int t,n,i,j,v; scanf("%d",&t); while(t--) { scanf("%d%d",&n,&v); for(i=1;i<=n;i++) scanf("%d",&val[i]); for(i=1;i<=n;i++) scanf("%d",&vol[i]); memset(dp,0,sizeof(dp)); for(i=1;i<=n;i++) for(j=v;j>=vol[i];j--) dp[j]=maxn(dp[j-vol[i]]+val[i],dp[j]); printf("%d\n",dp[v]); } return 0;}
- 典型背包问题
- 典型DP_背包问题
- XMU-1028(典型的背包问题(dp))
- POJ3624 Charm Bracelet(典型01背包问题)
- 杭电OJ 2602 典型01背包问题
- 1 0 背包问题 典型的 例题 : Bone Collector
- hdu 2546 典型01背包
- nyoj289 苹果 典型01背包问题(动态规划)思路及实现过程
- hdu 2191-wust9(多重背包典型)
- HDU2063:Investment-wust9(完全背包典型)
- 典型问题代码
- Linux操作系统典型问题
- ios典型问题
- 典型销售面试问题
- VC编译典型问题
- 典型递归问题1
- 典型递归问题2
- 典型递归问题3
- Unity3D 学习笔记(一)
- EXTJS4.x之实战项目(5)ArticleGridPanel实现增删改查之增
- 如何正确的打开google
- linux进程通信----共享内存
- 两个控制器之间的数据传递 (MVC)
- 典型背包问题
- PhotoShop算法原理解析系列
- 【转】XP/Win7/Vista和Linux(Ubuntu\fedora等)双系统下完美卸载Linux
- 判断字符串是不是数字的三种方法
- vi 复制粘贴详解
- [珠玑之椟]二分思想与分治法、排序思想
- spring配置连接数据库
- c语言实现封装,继承和多态
- 数据库知识总结