SPOJ DRUIDEOI 优先队列

Fata7y Ya Warda!

no tags 

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

Input:
3
5
172 170 168 171 169
3
172 169 172 
1
172

Output:
-1 -1
1 4
2 4
1 1
4 1
-1 -1
1 3
-1 -1
-1 -1

Note

The Third sample.

题意：一个环，找出每个数左边和右边第一个比他大的数的下标，如果没有 -1 -1。

题解：顺时针逆时针都模拟一遍，for到一个数，先解决这个数比优先队列的顶数大的那些，然后把他加进去。特判最大值。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
#include<vector>
using namespace std;
struct node{
	int num,lab;
	bool operator >(const node& a)const{
		return num>a.num;
	}
}e[100005];
int lef[100005],rig[100005];
priority_queue<node,vector<node>,greater<node> >sp;
int main(){
	int t;
	scanf("%d",&t);
	while(t--){
		int n,i,maxx=0;
		memset(lef,0,sizeof(lef));
		memset(rig,0,sizeof(rig));
		while(!sp.empty())sp.pop();
		scanf("%d",&n);
		for(i=1;i<=n;i++){
			scanf("%d",&e[i].num);
			e[i].lab=i;
			maxx=max(maxx,e[i].num);
		}
		int tim=0;
		for(i=n;;i--){
			if(i==0)i=n;
			tim++;
			if(tim==2*n+1)break;
			while(!sp.empty()&&e[i].num>(sp.top()).num){
				node f=sp.top();
				sp.pop();
				rig[f.lab]=i;
			}
			if(rig[i])continue;
			if(e[i].num==maxx){
				rig[i]=-1;
			}
			else{
				sp.push(e[i]);
			}
		}
		tim=0;
		while(!sp.empty())sp.pop();
		for(i=1;;i++){
			if(i==n+1)i=1;
			tim++;
			if(tim==2*n+1)break;
			while(!sp.empty()&&e[i].num>(sp.top()).num){
				node f=sp.top();
				sp.pop();
				lef[f.lab]=i;
			}
			if(lef[i])continue;
			if(e[i].num==maxx){
				lef[i]=-1;
			}
			else{
				sp.push(e[i]);
			}
		}
		for(i=1;i<=n;i++)printf("%d %d\n",rig[i],lef[i]);
	}
	return 0;
}