hdu 2639 Bone Collector II 01背包问题 求第K大最优值。。
来源:互联网 发布:楚楚街和淘宝 编辑:程序博客网 时间:2024/05/18 00:26
Bone Collector II
Time Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2665 Accepted Submission(s): 1392
Problem Description
The 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=2602
Today 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.
Here is the link:http://acm.hdu.edu.cn/showproblem.php?pid=2602
Today 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.
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, 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.
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.
Output
One integer per line representing the K-th maximum of the total value (this number will be less than 231).
Sample Input
35 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 Output
1220这样的问题,背包九讲里提到过。不行的去这个博客看吧。http://www.2cto.com/kf/201305/214139.html不过我感觉我的代码比他写的清楚。#include <cstdio>#include <cstring>#define MAX 1100using namespace std ;int dp[MAX][40],value[MAX],volume[MAX] , t1[40],t2[40];int main(){int c;scanf("%d",&c) ;while(c--){int n , v , k ;scanf("%d%d%d",&n,&v,&k) ;for(int i = 0 ; i < n ; ++i){scanf("%d",&value[i]) ;}for(int i = 0 ; i < n ; ++i){scanf("%d",&volume[i]) ;}memset(dp,0,sizeof(dp)) ;for(int i = 0 ; i < n ; ++i){for(int j = v ; j >= volume[i] ; --j){for(int m = 1 ; m <= k ; ++m){t1[m] = dp[j][m] ;t2[m] = dp[j-volume[i]][m] + value[i];}t1[k+1] = t2[k+1] = -1 ;int a = 1, b = 1 ;//下面是合并。 for(int m = 1 ; (a<=k||b<=k)&&m <= k ;){if(t1[a]>t2[b])dp[j][m] = t1[a++] ;else{dp[j][m] = t2[b++] ;}if(dp[j][m] != dp[j][m-1])++m ;}}}printf("%d\n",dp[v][k]) ;}return 0 ;}
1 0
- hdu 2639 Bone Collector II 01背包问题 求第K大最优值。。
- Hdu 2639 Bone Collector II(第K大最优解01背包)
- HDU - 2639 Bone Collector II(第K大01背包)
- hdu 2639 Bone Collector II 第k大01背包
- HDU 2639 Bone Collector II(01背包 求第k大)
- hdu 2639Bone Collector II(01背包求第k大)
- hdu 2639 Bone Collector II(第K大背包)
- hdu-2639-Bone Collector II【第K大背包】
- HDU 2639 Bone Collector II (求第K大的背包)
- HDU 2639(Bone Collector II)背包问题求第K优解
- Hdu 2639 Bone Collector II (01背包第k优解)
- hdu 2639Bone Collector II 01背包第k大问题
- hdu 2639 Bone Collector II 01背包第K优解
- HDU 2639 Bone Collector II 01背包第K优解
- hdu 2639 Bone Collector II 01背包 第k优解
- HDU 2639 Bone Collector II 01背包第k优解
- Bone Collector II HDU - 2639 01背包,第k优解
- HDU 2639 Bone Collector II(01背包第K大解)
- iOS 添加Cordova到已存在的Xcode 工程里
- HDU 2102 A计划
- 排水沟(Drainage Ditches)——最大流水题
- 工作中遇到的shell脚本知识(4)
- 【java编程】String之字符串反转
- hdu 2639 Bone Collector II 01背包问题 求第K大最优值。。
- Java之道系列:Annotation实现浅析
- 一个项目中初始化的问题
- Java NIO系列教程(二) Channel
- 关系型数据库 V.S. 非关系型数据库
- C语言及程序设计提高例程-19 越界的后果
- Spring定时任务的几种实现
- android:使用fragment实现tab切换
- (二)Maven学习笔记