BestCoder Round #84 Bellovin

Peter has a sequence a1,a2,…,ana1,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.

题意：题目好长，改成地球语是：求以ai结尾的最长上升子序列长度。
题解：题意都有了还要题解？？用nlogn的方法做就好了。

AC代码：

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<math.h>
using namespace std;

const int maxn=1e6+5;
int Case,n,k,maxl;
int a[maxn],g[maxn],f[maxn];

int bsearch(int l,int r,int x)
{
    while (r>l)
    {
        int mid=(l+r)>>1;
        if (g[mid]<x) l=mid+1;
        else r=mid;
    }
    return l;
}

int main()
{
    scanf("%d",&Case);
    for (int kk=1;kk<=Case;kk++)
    {
        scanf("%d",&n);
        for (int i=0;i<n;i++) scanf("%d",&a[i]);
        memset(f,0,sizeof(f));
        memset(g,0,sizeof(g));
        maxl=f[0]=1;
        g[1]=a[0];
        for (int i=1;i<n;i++)
        {
            if (a[i]>g[maxl])
            {
                maxl++;
                f[i]=maxl;
                g[maxl]=a[i];
                continue;
            }
            k=bsearch(1,maxl,a[i]);
            g[k]=a[i];
            f[i]=k;
        }
        for (int i=0;i<n-1;i++) printf("%d ",f[i]);
        printf("%d\n",f[n-1]);
    }
    return 0;
}

Best Coder的评测真的很神奇，一定注意输出格式，每个数据答案的最后一个数没有空格，一不小心PE 3次。