Bone Collector II(HDU-2639)
来源:互联网 发布:淘宝啥时候搞活动 编辑:程序博客网 时间:2024/05/21 17:06
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
题意:跟之前那个一样,多了个第k大;
思路:01背包+第k最优解;
思路:01背包+第k最优解;
#include<iostream>#include<cstdio>#include<cstring>#include<cmath>using namespace std;int n,m,k,t;int dp[1005][35],v[105],cost[105],A[35],B[35];int main(){ scanf("%d",&t); while(t--) { scanf("%d%d%d",&n,&m,&k); for(int i=1; i<=n; i++) scanf("%d",&v[i]); for(int i=1; i<=n; i++) scanf("%d",&cost[i]); memset(dp,0,sizeof(dp)); int a,b,c; for(int i=1; i<=n; i++) { for(int j=m; j>=cost[i]; j--) { for(int z=1; z<=k; z++) { A[z]=dp[j-cost[i]][z]+v[i]; //提取这个包的前k名; B[z]=dp[j][z]; //提取前几个包的前k名; } A[k+1]=B[k+1]=-1; a=b=c=1; while(c<=k && (A[a]!=-1 || B[b]!=-1)) //把这个包的前k名跟之前的前k名比较,留下比较之后的前k名; { if(A[a]>B[b]) { dp[j][c]=A[a]; a++; } else { dp[j][c]=B[b]; b++; } if(dp[j][c]!=dp[j][c-1]) c++; } } } cout<<dp[m][k]<<endl; } return 0;}
阅读全文
0 0
- 【HDU-2639】Bone Collector II(背包)
- Bone Collector II(HDU-2639)
- 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
- 九度1015:还是A+B
- Python3 使用 unicode-escape 处理 unicode 16进制字符串编解码问题
- Linux命令执行顺序控制与管道
- redis 整理
- 链表
- Bone Collector II(HDU-2639)
- Ansible 安装以及常用命令
- Python IDE安装指南(Xcode,Vim,Eclipse)
- vue 组件介绍
- 机器学习的前世今生:一部气势恢宏的人工智能发展史
- Android Studio安装并使用Kotlin插件
- ArraylList的扩容机制和使用ensureCapacity()方法提高性能
- 条款 01
- 如何遍历文件夹下的所有图片(Pyhton&C++)