Krydom: 暁の水平线に胜利を刻むのです

ソロモンの悪夢、見せてあげる!

@krydom2年前

08/21
18:31
主席树

Feed the dogs [poj 2761]

00:00/00:00

有没有wifi有没有wifi有而且耐用五毛勒!有没有wifi有没有wifi有而且耐用五毛勒!!

203fb80e7bec54e717bd766dbf389b504fc26a6b   m3xj2kmf5lajpg

♦♦♦♦♦♦   Description   ♦♦♦♦♦♦

 Wind loves pretty dogs very much, and she has n pet dogs. So Jiajia has to feed the dogs every day for Wind. Jiajia loves Wind, but not the dogs, so Jiajia use a special way to feed the dogs. At lunchtime, the dogs will stand on one line, numbered from 1 to n, the leftmost one is 1, the second one is 2, and so on. In each feeding, Jiajia choose an inteval[i,j], select the k-th pretty dog to feed.

Of course Jiajia has his own way of deciding the pretty value of each dog. It should be noted that Jiajia do not want to feed any position too much, because it may cause some death of dogs. If so, Wind will be angry and the aftereffect will be serious. Hence any feeding inteval will not contain another completely, though the intervals may intersect with each other.

Your task is to help Jiajia calculate which dog ate the food after each feeding.

 

题意:给出每只狗的pretty value,然后多次询问,每次输出区间[i,j](狗站成一排,从第i只到第j只)的第k小的值是多少。区间之间有交叉,但是没有完全包含。

♦♦♦♦♦♦   Input   ♦♦♦♦♦♦

 The first line contains n and m, indicates the number of dogs and the number of feedings.

The second line contains n integers, describe the pretty value of each dog from left to right. You should notice that the dog with lower pretty value is prettier.

Each of following m lines contain three integer i,j,k, it means that Jiajia feed the k-th pretty dog in this feeding.

♦♦♦♦♦♦   Output   ♦♦♦♦♦♦

 Output file has m lines. The i-th line should contain the pretty value of the dog who got the food in the i-th feeding.

♦♦♦♦♦♦   Sample Input   ♦♦♦♦♦♦

7 2

1 5 2 6 3 7 4

1 5 3

2 7 1

♦♦♦♦♦♦   Sample Output   ♦♦♦♦♦♦

3

2

♦♦♦♦♦♦   Hint   ♦♦♦♦♦♦

n<100001,m<50001

♦♦♦♦♦♦   题解  ♦♦♦♦♦♦

主席树模板题

先离散化然后主席树随便搞一搞就可以了

30adcbef76094b36f40a3994a5cc7cd98d109d2a

 

Feed the dogs [poj 2761]