a331: K-th Number
標籤 :
通過比率 : 64% (46 人 / 72 人 ) (非即時)
評分方式:
Tolerant

最近更新 : 2018-03-20 13:26

內容

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.

輸入說明

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).

輸出說明

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

範例輸入
7 3
1 5 2 6 3 7 4
2 5 3
4 4 1
1 7 3
範例輸出
5
6
3
測資資訊:
記憶體限制: 512 MB
公開 測資點#0 (10%): 2.0s , <1M
公開 測資點#1 (10%): 2.0s , <1M
公開 測資點#2 (10%): 2.0s , <10M
公開 測資點#3 (10%): 2.0s , <10M
公開 測資點#4 (10%): 2.0s , <10M
公開 測資點#5 (10%): 2.0s , <10M
公開 測資點#6 (10%): 2.0s , <10M
公開 測資點#7 (10%): 2.0s , <1M
公開 測資點#8 (10%): 2.0s , <1M
公開 測資點#9 (10%): 2.0s , <1M
提示 :

測資檔內可能有多筆輸入

標籤:
出處:
Northeastern Europe 2004Northern Subregion [編輯:
david942j (文旋)
]


編號 身分 題目 主題 人氣 發表日期
沒有發現任何「解題報告」