HDU 2639 Bone Collector II
来源:互联网 发布:java输出三角形 编辑:程序博客网 时间:2024/06/08 13:26
/*Problem DescriptionThe title of this problem is familiar,isn't it?yeah,if you had took part in the "Rookie Cup" competition,you must have seem this title.If you haven't seen it before,it doesn't matter,I will give you a link:Here is the link:http://acm.hdu.edu.cn/showproblem.php?pid=2602Today we are not desiring the maximum value of bones,but the K-th maximum value of the bones.NOTICE that,we considerate two ways that get the same value of bones are the same.That means,it will be a strictly decreasing sequence from the 1st maximum , 2nd maximum .. to the K-th maximum.If the total number of different values is less than K,just ouput 0. InputThe 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, K(N <= 100 , V <= 1000 , K <= 30)representing the number of bones and the volume of his bag and the K we need. 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. OutputOne integer per line representing the K-th maximum of the total value (this number will be less than 231). Sample Input35 10 21 2 3 4 55 4 3 2 15 10 121 2 3 4 55 4 3 2 15 10 161 2 3 4 55 4 3 2 1 Sample Output1220*/#include <stdio.h>#include <string.h>int main(){int t,N,V,K;int A[1005],B[1005],v[1005],w[1005];int dp[1005][35];int i,j,k;scanf("%d",&t);while(t--){scanf("%d%d%d",&N,&V,&K);memset(dp,0,sizeof(dp)); for(i=0;i<N;i++)scanf("%d",&v[i]); for(i=0;i<N;i++)scanf("%d",&w[i]); for(i=0;i<N;i++) { for(j=V;j>=w[i];j--) { for(k=1;k<=K;k++) { A[k]=dp[j][k];//上个子问题中保留的前K个最优值 B[k]=dp[j-w[i]][k]+v[i];//由K个最优衍生出来的K个值}A[k]=-1;B[k]=-1;int a,b,c;a=b=c=1;while(c<=K&&(A[a]!=-1||B[b]!=-1)){if(A[a]<B[b]){dp[j][c]=B[b];b++;}else{dp[j][c]=A[a];a++;}if(dp[j][c]!=dp[j][c-1])c++; } } } printf("%d\n",dp[V][K]);}return 0;}
0 0
- hdu 2639 Bone Collector II
- Hdu 2639 Bone Collector II
- hdu 2639 Bone Collector II
- hdu 2639 Bone Collector II
- HDU 2639 Bone Collector II
- HDU-2639-Bone Collector II
- hdu 2639 Bone Collector II
- HDU 2639 Bone Collector II
- hdu 2639 Bone Collector II
- hdu 2639 Bone Collector II
- hdu 2639 Bone Collector II
- HDU 2639 Bone Collector II
- HDU 2639 Bone Collector II
- hdu 2639 Bone Collector II
- Hdu 2639 Bone Collector II
- hdu 2639 Bone Collector II
- HDU 2639 Bone Collector II
- HDU 2639 Bone Collector II
- Linux文件和目录操作命令大全
- AndroidFlux一览
- 工厂模式(Factory Pattern)和java反射机制优化思考
- CentOS 7.1编译安装PHP7
- C++ STL 基础及应用(2) 模板与操作符重载
- HDU 2639 Bone Collector II
- pgloader
- 2015ACM长春赛区网络赛 A题 没写完
- 深度学习_caffe (4) 基于mnist实例搭建新的神经网络&在caffe中添加层
- µWebSockets:一种WebSocket服务器实现
- listview的下拉刷新和上滑加载。
- PHP7中php.ini、php-fpm和www.conf的配置
- 第十三周阅读程序 交通类纯虚函数
- Java中的String、StringBuilder以及StringBuffer