Bellovin HDU - 5748

Peter has a sequence a1,a2,...,an and he define a function on the sequence -- F(a1,a2,...,an)=(f1,f2,...,fn) , where fi is the length of the longest increasing subsequence ending with ai .

Peter would like to find another sequence b1,b2,...,bn in such a manner that F(a1,a2,...,an) equals to F(b1,b2,...,bn) . Among all the possible sequences consisting of only positive integers, Peter wants the lexicographically smallest one.

The sequence a1,a2,...,an is lexicographically smaller than sequence b1,b2,...,bn , if there is such number i from 1 to n , that ak=bk for 1≤k<i and ai<bi

.

Input

There are multiple test cases. The first line of input contains an integer T , indicating the number of test cases. For each test case:

The first contains an integer n (1≤n≤100000) -- the length of the sequence. The second line contains n integers a1,a2,...,an (1≤ai≤109)

.

Output

For each test case, output n integers b1,b2,...,bn (1≤bi≤109)

denoting the lexicographically smallest sequence.

Sample Input

3
1
10
5
5 4 3 2 1
3
1 3 5

Sample Output

1
1 1 1 1 1
1 2 3

以数组中每个元素结尾的最长上升字符串的长度

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
const int N = 100005;
int a[N],b[N],c[N];
int main(){
	int T;
	scanf("%d",&T);
	while(T--){
		memset(b,0,sizeof(b));
		int n;
		scanf("%d",&n);
		for(int i=0;i<n;i++)
		    scanf("%d",&a[i]);
		int cnt=0;
		b[cnt++]=a[0];
		c[0]=1;
		for(int i=1;i<n;i++){
			if(a[i]>b[cnt-1]){
				b[cnt++]=a[i];
				c[i]=cnt;
			}
			else{
				int temp=higter_bound(b,b+cnt,a[i])-b;
				b[temp]=a[i];
				c[i]=temp+1;
			}
		}
		for(int i=0;i<n-1;i++)
		   printf("%d ",c[i]);
		printf("%d\n",c[n-1]);
	}
	return 0;
}