SPOJ DRUIDEOI – Fata7y Ya Warda!(破环成链+单调栈)

Druid (AKA Amr Alaa El-Deen) and little EOIers have finished their training and they are playing “Fatta7y ya warda!”. It’s a kids game when everyone holds hands with two other kids forming a circle, and they keep saying “Fatta7y ya warda!” (Flourish, flower!) (moving away from each other, while still holding hands, to form a huge circle), then “2affely ya warda!” (Die, flower!) (moving back as close to each other as possible, while still holding hands, to form a tiny circle, i.e. a point). That’s it!

Anyway the point is…

While Eagle (AKA Mohamed Ahmed) was watching them playing he was wondering, who’s the first person taller than Druid on his left? Similarly, who’s the first person taller than Druid on his right? Help Eagle find the answer for each person not just Druid.

Input

The input starts with an integer T (1 ≤ T ≤ 20), the number of test cases.

Each test case contains two lines. The first line contains a single integer N (1 ≤ N ≤ 105), the number of persons playing the game. The second line contains N integers hi (1 ≤ hi ≤ 109) the height of the i-th person. They are numbered 1 to N starting from Druid.

Output

For each test case print N lines, in the i-th line print 2 numbers, the index of the first person taller than the i-th person on his left, and the index of the first person taller than the i-th person on his right. If no one is taller than the i-th person print -1 -1.

Example

碰到这种问题,就是先把环拆开,然后弄个单调栈维护一下。从左向右扫一次,再从右向左扫一次。

 

发表评论

电子邮件地址不会被公开。 必填项已用*标注