hdu 2602 整理下水题 背包
来源:互联网 发布:绝地求生有数据接口吗 编辑:程序博客网 时间:2024/06/11 22:04
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>#define max(a,b)a>b?a:busing namespace std;int f[10001];int c[10001],v[10001];int main(){int T;int n,V;int i,j;scanf("%d",&T);while(T--){scanf("%d%d",&n,&V);for(i=0;i<n;i++)scanf("%d",&c[i]);for(i=0;i<n;i++)scanf("%d",&v[i]);memset(f,0,sizeof(f));for(i=0;i<n;i++) { for(j=V;j>=v[i];j--) { f[j]=max(f[j],f[j-v[i]]+c[i]); } }printf("%d\n",f[V]);}}
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
0 0
- hdu 2602 整理下水题 背包
- hdu 2037 整理下水题
- hdu 1870 整理下水题
- hdu 1711 整理下水题
- hdu 1009 整理下水题 贪心
- hdu 1789 整理下水题 贪心
- hdu 1106 整理下水题 排序
- hdu 2020 整理下水题 排序
- hdu 1425 整理下水题 排序
- hdu 1785 整理下水题 排序
- hdu 1702 整理下水题 栈和队列
- hdu 1022 整理下水题 栈和队列
- hdu 2013 整理下水题 递推动规
- hdu 2041 整理下水题 递推动规
- hdu 2569 整理下水题 递推动规
- hdu 2084 整理下水题 递推动规
- hdu 1159 整理下水题 递推动规
- HDU-1076-An Easy Task(Debian下水题测试.....)
- Git详解之三:Git分支
- 小数化分数2
- Bmob
- struts2 java.lang.UnsupportedClassVersionError: Bad version number in .class file 解决
- Android的Menu
- hdu 2602 整理下水题 背包
- 架构师速成2-概述
- 城市修路 连通
- 什么是IaaS、PaaS和SaaS及其区别
- 【C++学习】map
- 单例模式
- matlab绘图函数plot
- hdu 1711 整理下水题
- BZOJ3190 [JLOI2013]赛车(单调栈+半平面交)