Bone Collector
来源:互联网 发布:c语言long long 编辑:程序博客网 时间:2024/06/04 18:29
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 ?
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.
Output
One integer per line representing the maximum of the total value (this number will be less than 231).
Example Input
15 101 2 3 4 55 4 3 2 1
Example Output
14题意大概:第一行输入测试数据的组数。 第二行输入骨头的个数和自己背包的体积。 第三行输入每个骨头的价值。 第四行输入每个骨头的体积。 输出可以获得的最大价值。此题为背包问题中的一种,一个物品只能拿一次,求最大获得价值。
#include<stdio.h>#include<string.h>int df[1000];int max(int a,int b){ return (a>b?a:b);}int main(){ int t,i,j,n,v; int p[1000],w[1000]; scanf("%d",&t); while(t--) { memset(df,0,sizeof(df)); scanf("%d%d",&n,&v); for(i=0;i<n;i++) { scanf("%d",&p[i]); } for(i=0;i<n;i++) { scanf("%d",&w[i]); } for(i=0;i<n;i++) { for(j=v;j>=w[i];j--) { df[j]=max(df[j-w[i]]+p[i],df[j]); } } printf("%d\n",df[v]); } return 0;}
0 0
- Bone Collector
- Bone Collector
- Bone Collector
- Bone Collector
- Bone Collector
- Bone Collector
- Bone Collector
- Bone Collector
- Bone Collector
- Bone Collector
- Bone Collector
- Bone Collector
- Bone Collector
- Bone Collector
- Bone Collector
- Bone Collector
- Bone Collector
- Bone Collector
- 区块链地址聚类分析可用工具汇总
- 用BitmapShader实现圆形图片
- Spring定时任务的几种实现
- 【Studio】Android Studio如何最快速、顺利导入其他项目
- 使用enable_shared_from_this
- Bone Collector
- JVM内存模型和性能优化
- 笔记:Semi-Supervised Low-Rank Representation for Image Classification
- Linux进程描述符task_struct
- hdu 2594
- React-Native 中的生命周期
- Spring事务管理所遇到的坑
- OSGI企业应用开发(十五)基于Spring、Mybatis、Spring MVC实现一个登录应用
- Android 实现圆形图片的几种方法