hdu 5748 Bellovin

Problem Description

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

题意：定义： F(a1,a2,...,an)=(f1,f2,...,fn), fi为在数列F中以ai结尾的最长上升子列的长度，给一个数列a，求与a相同的F的数列b。

思路：求出以ai结尾的长度 Lii，当bi干好等于 Li+1 时正好是 lexicographically smallest sequence 。

#include <iostream>
#include<stdio.h>
#include<string.h>
#define siz 100005
using namespace std;
int n,a[siz],d[siz],dv[siz];
int bfind(int x,int z){ //二分查找：还回第一个大于等于x的值，边界（0，z+1）；
    int l,r,mid;
    l=0,r=z;
    while(l<=r){
        mid=(l+r)/2;
        if(d[mid]<x){
            l=mid+1;
        }else
        {
            r=mid-1;
        }
    }
    return l;
}
void LIS(){
    int j=0;
    d[0]=a[1];
    dv[1]=0;
    for(int i=2;i<=n;i++){
        int r=bfind(a[i],j);
        d[r]=a[i];
        dv[i]=r;
        if(r>j) j++;
    }
}
int main()
{
    int T;
    cin>>T;
    while(T--){
        memset(d,0,sizeof(d));
        scanf("%d",&n);
        for(int i=1;i<=n;i++) scanf("%d",&a[i]);
        LIS();
        for(int i=1;i<n;i++){
            cout<<dv[i]+1<<" ";
        }
        cout<<dv[n]+1<<endl;
    }
    return 0;
}