POJ 2104 - K-th Number

原创 2016年08月30日 17:46:17

Description

You are working for Macrohard company in data structures department. After failing your previous task about key insertion you were asked to write a new data structure that would be able to return quickly k-th order statistics in the array segment.
That is, given an array a[1...n] of different integer numbers, your program must answer a series of questions Q(i, j, k) in the form: "What would be the k-th number in a[i...j] segment, if this segment was sorted?"
For example, consider the array a = (1, 5, 2, 6, 3, 7, 4). Let the question be Q(2, 5, 3). The segment a[2...5] is (5, 2, 6, 3). If we sort this segment, we get (2, 3, 5, 6), the third number is 5, and therefore the answer to the question is 5.


Input

The first line of the input file contains n --- the size of the array, and m --- the number of questions to answer (1 <= n <= 100 000, 1 <= m <= 5 000).
The second line contains n different integer numbers not exceeding 109 by their absolute values --- the array for which the answers should be given.
The following m lines contain question descriptions, each description consists of three numbers: i, j, and k (1 <= i <= j <= n, 1 <= k <= j - i + 1) and represents the question Q(i, j, k).


Output

For each question output the answer to it --- the k-th number in sorted a[i...j] segment.


Sample Input

7 3
1 5 2 6 3 7 4
2 5 3
4 4 1
1 7 3


Sample Output

5
6
3


题意:在给出 m 个数字和 n 个操作次数,每个操作次数给出3个数a,b,c,求出在区间 [a, b] 中第 c 大的数。

每个数字不但给他们数值,也给出序号,每次操作时从小到大遍历,遇到区间内的 c-1 ,直到 c 减到0即是答案。

#include <cstdio>
#include <algorithm>
using namespace std;

struct node
{
    int n, no;
};
node num[1000000 + 5];

int cmp(node a, node b)
{
    return a.n < b.n;
}

int main()
{
    int m, n;
    scanf("%d%d", &m, &n);
    for (int i = 0; i < m; ++i)
    {
        scanf("%d", &num[i].n);
        num[i].no = i;
    }
    sort(num, num+m, cmp);
    for (int i = 0; i < n; ++i)
    {
        int from, to, sym;
        scanf("%d%d%d", &from, &to, &sym);
        from--;
        to--;
        for (int j = 0; j < m; ++j)
        {
            if (num[j].no >= from && num[j].no <= to)
                sym--;
            if (sym == 0)
            {
                printf("%d\n", num[j].n);
                break;
            }
        }
    }
    return 0;
}


版权声明:Designed by Sureina 2016©Copyright.All Right Reserved

poj 2104 K-th Number 主席树+超级详细解释

传送门:K-th Number题目大意:给出一段数列,让你求[L,R]区间内第几大的数字!在这里先介绍一下主席树! 如果想了解什么是主席树,就先要知道线段树,主席树就是n棵线段树,因为线段树只能维护...
  • woshinannan741
  • woshinannan741
  • 2016年11月02日 21:45
  • 674

【poj2104】K-th Number 分块

DescriptionYou are working for Macrohard company in data structures department. After failing your p...
  • LOI_DQS
  • LOI_DQS
  • 2015年09月19日 21:13
  • 672

POJ 2104 K-th Number (线段树)

K-th Number Time Limit: 20000MS   Memory Limit: 65536K Total Submissions: 46589   Accepted: 15...
  • a2459956664
  • a2459956664
  • 2016年05月03日 10:19
  • 2051

poj2104K-th Number (主席树)

K-th Number Time Limit: 20000MS   Memory Limit: 65536K Total Submissions: 46886   Accepted: 15...
  • su20145104009
  • su20145104009
  • 2016年05月17日 20:58
  • 4310

poj2104 k-th number 主席树入门讲解

定义:主席树是一种可持久化的线段树 又叫函数式线段树 刚开始学是不是觉得很蒙逼啊 其实我也是  主席树说简单了 就是保留你每一步操作完成之后的线段树 然后有可加减性 呃 。。。 这么说好...
  • qq_34271269
  • qq_34271269
  • 2017年02月03日 21:21
  • 492

poj 2104 K-th Number (分桶法和平方分割)

K-th Number Time Limit: 20000MS   Memory Limit: 65536K Total Submissions: 53887   Accepted: 18...
  • bmicnj
  • bmicnj
  • 2017年03月12日 17:12
  • 282

POJ 2104 K-th Number(区间第k大数)(平方分割,归并树,划分树)

题目链接: http://poj.org/problem?id=2104 解题思路: 因为查询的个数m很大,朴素的求法无法在规定时间内求解。因此应该选用合理的方式维护数据来做到高效地查询。 如果x是...
  • piaocoder
  • piaocoder
  • 2015年08月25日 10:56
  • 1343

poj 2104 K-th number

Description You are working for Macrohard company in data structures department. After failing yo...
  • b2utyyomi
  • b2utyyomi
  • 2016年09月11日 12:35
  • 111

POJ 2104 . K-th Number

POJ 2104 . K-th Number DescriptionYou are working for Macrohard company in data structures departmen...
  • liyizhixl
  • liyizhixl
  • 2017年06月27日 21:31
  • 151

poj 2104 k-th number

K-th Number Time Limit: 20000MS   Memory Limit: 65536K Total Submissions: 45330   Accepted: 15...
  • clover_hxy
  • clover_hxy
  • 2016年03月06日 21:12
  • 291
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:POJ 2104 - K-th Number
举报原因:
原因补充:

(最多只允许输入30个字)