【HDU
来源:互联网 发布:06款雅马哈r1数据 编辑:程序博客网 时间:2024/06/12 11:07
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 2 31).
Sample Input
1
5 10
1 2 3 4 5
5 4 3 2 1
Sample Output
14
分析 01背包的模板
代码
#include<bits/stdc++.h>#define LL long longusing namespace std;const int MAXN = 1e3+10;const int MAXM = 1e5;int dp[MAXN]; int cost[MAXN],val[MAXN];int main(){ int t;cin>>t; while(t--){ int n,v;scanf("%d%d",&n,&v); for(int i=1;i<=n;i++) scanf("%d",&val[i]); for(int i=1;i<=n;i++) scanf("%d",&cost[i]); memset(dp,0,sizeof(dp));// 因为题目没有要求要恰好装满 for(int i=1;i<=n;i++){ for(int j=v;j>=cost[i];j--) dp[j]=max(dp[j],dp[j-cost[i]]+val[i]); } printf("%d\n",dp[v]) ; } return 0;}
- hdu
- hdu
- HDU
- hdu ()
- hdu
- hdu
- HDU
- HDU
- hdu
- hdu
- HDU
- Hdu
- hdu
- hdu-
- hdu
- hdu
- hdu
- HDU
- 纯js 实现弹幕效果
- httpsession跨域请求不能保存的问题
- 基于bs4的HTML内容遍历方法
- Android使用非Activity引用启动页面报错!
- 在IDEA下 spring+springMVC+hibernate+maven框架搭建
- 【HDU
- Android 获取联系人和电话号码
- Java curator操作zookeeper获取kafka
- c#字符常用方法
- 使用eclipse启动系统时报错“ java.lang.OutOfMemoryError: PermGen space”问题的解决
- bootstrap 清楚浮动
- 23种设计模式-前言
- JSON格式解析和libjson使用简介(cJson格式)
- ZZULIOJ【1055】兔子繁殖问题【递推】&&【斐波那契】