Hdu 2602 Bone Collector
来源:互联网 发布:移动网络宽带投诉电话 编辑:程序博客网 时间:2024/05/16 13:57
Bone Collector
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).
Sample Input
1
5 10
1 2 3 4 5
5 4 3 2 1
Sample Output
14
01背包水题
#include<bits/stdc++.h>using namespace std;int main(){ ios::sync_with_stdio(0); cin.tie(0); int T; cin>>T; while(T--) { int N,V; cin>>N>>V; vector<long long>value(1005,0),weight(1005,0),dp(1005,0); for(int i=1;i<=N;i++) cin>>value[i]; for(int i=1;i<=N;i++) cin>>weight[i]; for(int i=1;i<=N;i++) for(int j=V;j>=weight[i];j--) dp[j]=max(dp[j],dp[j-weight[i]]+value[i]); cout<<dp[V]<<endl; } return 0;}
- HDU 2602 Bone Collector
- hdu 2602 Bone Collector
- hdu 2602 Bone Collector
- hdu 2602 Bone Collector
- HDU 2602 - Bone Collector
- HDU 2602 Bone Collector
- hdu 2602 Bone Collector
- HDU 2602 Bone Collector
- hdu 2602 Bone Collector
- hdu 2602 Bone Collector
- Hdu 2602 - Bone Collector
- hdu 2602 Bone Collector
- hdu 2602 Bone Collector
- Hdu 2602 Bone Collector
- Hdu 2602 Bone Collector
- hdu 2602 Bone Collector
- hdu - 2602 - Bone Collector
- hdu 2602 Bone Collector
- [FAQ16697]第一开机或者恢复出厂设置后,桌面小部件很长时间才更新到正常的画面
- AOP技术基础
- tab切换图片
- 雅思口语考官常问的100个话题整理-自己整理
- Android 页面传值
- Hdu 2602 Bone Collector
- ARIA
- 机器学习入门01-knn
- 对象创建
- Java消息中间件之Spring中的ActiveMQ
- linux(三)之linux常用命令二
- AOP概念
- BZOJ3507通配符匹配(DP + Hash)
- javaScript—tab切换