【HDU2639】Bone Collector II
来源:互联网 发布:移动网络下载不了电影 编辑:程序博客网 时间:2024/05/31 19:26
Bone Collector II
Time Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2667 Accepted Submission(s): 1394
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
百万秦关终属楚
Recommend
teddy
#include <cstring>
#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <cmath>
#include <map>
#include <queue>
using namespace std;
int T;
int N,V,K;
int v[110];
int w[110];
int dp[1010][35];
int A[35];
int B[35];
int main()
{
scanf("%d",&T);
while(T --)
{
memset(A,0,sizeof(A));
memset(B,0,sizeof(B));
memset(dp,0,sizeof(dp));
scanf("%d%d%d",&N,&V,&K);
for(int i=1;i<=N;i++)
{
scanf("%d",&v[i]);
}
for(int i=1;i<=N;i++)
{
scanf("%d",&w[i]);
}
for(int i=1;i<=N;i++)
{
for(int j=V;j>=w[i];j--)
{
int k;
for( k=1;k<=K;k++)
{
A[k] = dp[j][k];
B[k] = dp[j-w[i]][k] + v[i];
}
A[k] = -1;
B[k] = -1;
int a,b,c;
a = b = c = 1;
while(c <= K && (A[a] != -1 || B[a] != -1))
{
if(A[a] > B[b])
{
dp[j][c] = A[a++];
}
else
{
dp[j][c] = B[b++];
}
if(c == 1 || dp[j][c] != dp[j][c-1])
c++;
}
}
}
printf("%d\n",dp[V][K]);
}
return 0;
}
#include <cstring>
#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <cmath>
#include <map>
#include <queue>
using namespace std;
int T;
int N,V,K;
int v[110];
int w[110];
int dp[1010][35];
int A[35];
int B[35];
int main()
{
scanf("%d",&T);
while(T --)
{
memset(A,0,sizeof(A));
memset(B,0,sizeof(B));
memset(dp,0,sizeof(dp));
scanf("%d%d%d",&N,&V,&K);
for(int i=1;i<=N;i++)
{
scanf("%d",&v[i]);
}
for(int i=1;i<=N;i++)
{
scanf("%d",&w[i]);
}
for(int i=1;i<=N;i++)
{
for(int j=V;j>=w[i];j--)
{
int k;
for( k=1;k<=K;k++)
{
A[k] = dp[j][k];
B[k] = dp[j-w[i]][k] + v[i];
}
A[k] = -1;
B[k] = -1;
int a,b,c;
a = b = c = 1;
while(c <= K && (A[a] != -1 || B[a] != -1))
{
if(A[a] > B[b])
{
dp[j][c] = A[a++];
}
else
{
dp[j][c] = B[b++];
}
if(c == 1 || dp[j][c] != dp[j][c-1])
c++;
}
}
}
printf("%d\n",dp[V][K]);
}
return 0;
}
0 0
- 【HDU2639】Bone Collector II
- hdu2639 Bone Collector II
- 【hdu2639】【Bone Collector II】
- hdu2639 Bone Collector II
- HDU2639-Bone Collector II
- HDU2639 Bone Collector II
- hdu2639 Bone Collector II
- HDU2639 Bone Collector II 背包K优解
- HDU2639:Bone Collector II(01背包)
- hdu2639---Bone Collector II(01背包升华)
- hdu2639 Bone Collector II(01背包)
- hdu2639 Bone Collector II 01背包第K优解
- HDU2639 - Bone Collector II(第k大01背包)
- hdu2639 Bone Collector II--01背包K优解
- 【01背包-Kth优解】HDU2639-Bone Collector II
- hdu2639 Bone Collector II (01背包第k大解)
- hdu2639 Bone Collector II(01背包第k优解)
- HDU2639:Bone Collector II(01背包第k优解)
- 几种常见的内嵌数据库
- 【mfc】标签页
- Poj 2084 Game of Connections(高精度卡特兰数)
- JQuery Mobile 学习笔记2-4:changePage()方法跳转页面
- 使用服务(内置)动态填充dropdownlist
- 【HDU2639】Bone Collector II
- IP3 比1DB压缩点 大10DB
- 按时间给表建立range分区
- leetcode Search Input Position
- 汉游天下公司的一些感悟
- Poj 2251 Dungeon Master(三维Dfs)
- 关于Cocos2d-x的一些认识(2)
- Android 百度地图 SDK v3_3_0 (三) ---离线地图
- TalkingData:2014年移动打车应用行业报告