HDU Bone Collector II
来源:互联网 发布:六级听力怎么练 知乎 编辑:程序博客网 时间:2024/05/08 04:37
Bone Collector II
Time Limit : 5000/2000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)
Total Submission(s) : 27 Accepted Submission(s) : 14
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.
Output
One integer per line representing the K-th maximum of the total value (this number will be less than 2[sup]31[/sup]).
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
题目代码:
#include<iostream>
#include<stdlib.h>
#include<stdio.h>
#include<string.h>
#include<algorithm>
int dp[1001][200];
using namespace std;
int main()
{
int T,N,V,K,value[105],volume[105],A[50],B[50],i,j,k,a,b; //代表有T组测试数据
scanf("%d",&T);
while(T--)
{
memset(dp,0,sizeof(dp));
scanf("%d%d%d",&N,&V,&K);//N代表骨头的数量,V代表他的背包的体积,K代表第K优解
for(i=0;i<N;i++)
scanf("%d",&value[i]); //每种骨头的价值
for(i=0;i<N;i++)
scanf("%d",&volume[i]); //每种骨头的体积
for(i=0;i<N;i++)
for(j=V;j>=volume[i];j--)
{
for(k=1;k<=K;k++)
A[k]=dp[j][k];
for(k=1;k<=K;k++)
B[k]=dp[j-volume[i]][k]+value[i];
A[k]=B[k]=-1;
a=b=k=1;
while(k<=K&&A[a]!=-1||B[b]!=-1)
{
if(A[a]>B[b])
{
dp[j][k]=A[a];
a++;
}
else
{
dp[j][k]=B[b];
b++;
}
if(dp[j][k]!=dp[j][k-1])
k++;
}
}
printf("%d\n",dp[V][K]);
}
return 0;
}
0 0
- HDU Bone Collector II
- hdu 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 2963 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
- LeetCode 2 - Add Two Numbers
- 匹配“is outside location”
- 用html5 canvas js 实现图片大小的压缩显示,图片上传后可在线预览。
- android Tips
- 将Gif图转换成Unity Texture2D
- HDU Bone Collector II
- SVG实现超酷素描动画
- PyQT实现一个自动生成配置工具
- 浙大PAT甲级 1100
- Java排序算法--堆排序(HeapSort)
- public int? Salary { get; set; }
- 51nod-1134最长上升子序列
- java环境变量的配置及常用命令提示符语句
- 用CMutex类实现程序互斥运行