BestCoder Round #84

#include <iostream>
#include <map>
#include <cstdio>
#include <cstring>
using namespace std;

const int MAXN = 1e5+100;

int a[MAXN],b[MAXN];
int c[MAXN];

int main()
{
    int T;
    scanf("%d",&T);
    while(T--){
        int n;
        int top=0;
        int mmax = -1;
        scanf("%d",&n);
        for(int i=0;i<n;i++){
            scanf("%d",&a[i]);
            int l=0,r=top;
            while(l<r){
                int m = l+(r-l)/2;
                if(b[m]>=a[i]){
                    r = m;
                }else{
                    l = m+1;
                }
            }
            if(l==top){top++;b[l] = a[i];}
            else if(a[i]<b[l]){
                b[l] = a[i];
            }
            //mmax = max(mmax,l+1);
            c[i] = l+1;
        }
        for(int i=0;i<n;i++){
            if(i==0)printf("1");
            else{
                printf(" %d",c[i]);
            }
        }
        cout<<endl;
    }

    return 0;
}