关闭

hdu 2639 Bone Collector II (01背包)

262人阅读 评论(0) 收藏 举报
分类:

http://acm.hdu.edu.cn/showproblem.php?pid=2639

Bone Collector II

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.
 
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 231).
 
Sample Input
3 5 10 2 1 2 3 4 5 5 4 3 2 1 5 10 12 1 2 3 4 5 5 4 3 2 1 5 10 16 1 2 3 4 5 5 4 3 2 1
 
Sample Output
12 2 0

题目大意

    见之前的收集骨头的博客,题意类似,给定背包容量,骨头的个数和每个骨头的价值,这次不是求在背包容量允许的情况下,最多装的价值,而是求在背包容量内,可以装的第k大价值,如果没有第k个最大值,那么输出0

    输入包括多组样例,第一行输入一个T,样例的个数,接下来每个样例都有三行,第一行包括三个整数,N,V,K,分别代表骨头的个数,背包的容量,我们需要输出的第K个最大值,第二行包括N个数,分别代表骨头的数量和接下来一行有N个数,分别表示每种骨头的价值。

    输出第K个最大价值,每个样例输出一行

思路:简单的01背包基础上做,要求的是第K个最大值,那么不用dp[j]=max(dp[j],dp[j-w[i]]+v[i])的状态转移方程,而是将两个值都记录下来,用for循环走一遍,记录下,容量为1到M的各个最大价值,dp[i][j]表示当背包容量为i时的第j个最大价值,最后只需要输出dp[m][k]即可

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <limits>
#include <queue>
#include <stack>
#include <vector>
#include <map>

using namespace std;
typedef  long long LL;

#define N 1100
#define INF 0x3f3f3f3f
#define PI acos (-1.0)
#define EPS 1e-8
#define met(a, b) memset (a, b, sizeof (a))

int dp[N][N];

int main ()
{
    int t, n, m, K, v[N], w[N], a[N], b[N];

    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", &w[i]);

        met (dp, 0);
        met (a, 0);
        met (b, 0);

        for (int i=1; i<=n; i++)
        for (int j=m; j>=w[i]; j--)
        {
            for (int 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] = -1;
            int x = 1, y = 1, z = 1;

            while ((a[x] != -1 || b[y] != -1) && z <= K)
            {
                if (a[x] > b[y]) dp[j][z] = a[x++];
                else dp[j][z] = b[y++];
                if (dp[j][z-1] != dp[j][z]) z++;
            }
        }
        printf ("%d\n", dp[m][K]);
    }
    return 0;
}



1
0
查看评论

HDU--2639--Bone Collector II--01背包

Bone Collector IITime Limit: 5000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2464 ...
  • hncu1206401liuhao
  • hncu1206401liuhao
  • 2014-12-02 01:19
  • 663

HDU 2639 Bone Collector II

题目分析 这道题要求第K大背包,很显然数组增加一维K,01背包的状态转移式 为dp[i][j] = max(dp[i-1][j], dp[i-1][j-vol[i]] + val[i]); 很明显可以看出dp[i][j]只与公式后面的2个状态有关,因此只要在推的过程中 保存中间...
  • chen_ze_hua
  • chen_ze_hua
  • 2016-06-16 10:10
  • 194

HDU-2639-Bone Collector II

这个题是HDU-2602-Bone Collector升级版,改为求第k大的值 思路: 将背包的维数增加一维,存的时候注意去重~ 代码: #include #include #include using namespace std; const int maxn=1001; int n,m,...
  • z309241990
  • z309241990
  • 2013-07-06 23:05
  • 970

hdu2639Bone Collector II

第k优解
  • u014303647
  • u014303647
  • 2014-05-16 11:02
  • 848

hdu2639 Bone Collector II 01背包边形,第k大价值

链接:点我 现在01的基础上多加一维,dp[v][k],表示在v空间下第k大的价值。。。 更新的时候有两个数组A、B,A记录选择第i个物品的从大到小排列,B记录不选择的从大到小排列,然后合并AB,选出AB里面前k个最大的。合并到dp中。。。 #include #include using ...
  • liuqiyao_01
  • liuqiyao_01
  • 2013-04-02 15:56
  • 2967

【杭电oj】2602 - Bone Collector(01背包)

Bone Collector Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 46972 ...
  • wyg1997
  • wyg1997
  • 2016-04-22 21:47
  • 425

HDU 2639 - Bone Collector II(01背包)

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 se...
  • u013534690
  • u013534690
  • 2014-10-12 21:40
  • 290

HDU 2639 Bone Collector II(01背包变型)

此题就是在01背包问题的基础上求所能获得的第K大的价值。 具体做法是加一维去推当前背包容量第0到K个价值,而这些价值则是由dp[j-w[ i ] ][0到k]和dp[ j ][0到k]得到的,其实就是2个数组合并之后排序,但是实际做法最好不要怎么做,因为你不知道总共有多少种,而我们最多只需要前K个...
  • u012962816
  • u012962816
  • 2014-07-18 14:23
  • 670

HDU 2639 Bone Collector II(DP:01背包)

HDU 2639 Bone Collector II(DP:01背包) http://acm.hdu.edu.cn/showproblem.php?pid=2639 题意:同样有N个物品,每个物品有weight和value,问你在总重量不超过W的情况下,使得value值尽量大.得到的第K大的va...
  • u013480600
  • u013480600
  • 2014-04-03 00:22
  • 684

杭电ACM 2602 Bone Collector背包

Bone Collector Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 58027...
  • shellhard
  • shellhard
  • 2017-03-14 23:13
  • 172
    个人资料
    • 访问:80221次
    • 积分:3564
    • 等级:
    • 排名:第10993名
    • 原创:277篇
    • 转载:6篇
    • 译文:0篇
    • 评论:17条
    最新评论