hdu2639 Bone Collector II (01背包第k大解)
来源:互联网 发布:巨衫数据库待遇怎么样 编辑:程序博客网 时间:2024/04/28 12:19
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
Author
teddy
Source
百万秦关终属楚
题意:给出一行价值,一行体积,让你在v体积的范围内找出第k大的值;
思路:01背包的进一步优化,普通的背包是求得最大值;
需要求第k大,我们需要在dp数组上多开一维,记录v体积下第k大的值;
然后我们利用01背包思想将原值与新得到的值进行按大小合并;
代码:
#include<cstdio>#include<algorithm>#include<cstring>using namespace std;const int maxn=105;int dp[1010][50];int value[maxn],weight[maxn];int a[50],b[50];int n,V,K;void solve_dp(){ memset(dp,0,sizeof(dp)); for(int i=0;i<n;i++) for(int j=V;j>=weight[i];j--) { for(int k=1;k<=K;k++) { a[k]=dp[j][k]; b[k]=dp[j-weight[i]][k]+value[i]; } int x,y,z; x=y=z=1; a[K+1]=b[K+1]=-1; while((z<=K)&&(x<=K||y<=K)) //合并 { if(a[x]>b[y]) dp[j][z]=a[x++]; else dp[j][z]=b[y++]; if(dp[j][z]!=dp[j][z-1]) z++; } }}int main(){ int t; scanf("%d",&t); while(t--) { 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",&weight[i]); solve_dp(); printf("%d\n",dp[V][K]); }}
0 0
- hdu2639 Bone Collector II (01背包第k大解)
- HDU 2639 Bone Collector II(01背包第K大解)
- hdu2639 Bone Collector II 01背包第K优解
- HDU2639 - Bone Collector II(第k大01背包)
- hdu2639 Bone Collector II(01背包第k优解)
- HDU2639:Bone Collector II(01背包第k优解)
- hdu2639 Bone Collector II(01背包)
- HDU2639 Bone Collector II 背包K优解
- hdu 2639 Bone Collector II(01背包的 第K大解)
- hdu2639 Bone Collector II--01背包K优解
- hdu2639 Bone Collector II 01背包边形,第k大价值
- hdu2639 bone collector II 01背包第k优解 TWT Tokyo Olympic 1COMBO-1
- hdu2639 Bone Collector II (01背包第k优解模版)
- HDU2639:Bone Collector II(01背包)
- hdu2639---Bone Collector II(01背包升华)
- hdu2639——Bone Collector II——————【01背包、第k优解】
- Bone Collector II(01背包 第K优解)
- 【01背包-Kth优解】HDU2639-Bone Collector II
- SOAP方式的CXF WebService实现
- 160. Intersection of Two Linked Lists(Linked List-Easy)
- EF映射
- PowerShell文件系统(五)管理访问权限
- 禁止按钮在一定时间内连续点击
- hdu2639 Bone Collector II (01背包第k大解)
- CSS格式化排版
- 蓝桥 方格填数
- Linux下lua安装以及和c的交互
- caffe源码深入学习4:支持魔改的layer:layer.hpp与layer.cpp
- MFC学习小记(1) MFC的入口点与消息循环,消息映射
- BS CS
- 无向图 DST图的深度遍历 BST图的广度遍历
- 在react中如何使用tab组件-小白系列 es6