F简单排序

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int a[100000];
    int n;
    int tp,size = 0;
    scanf("%d",&n);
    for(int i =0;i<n;i++)
    {       
        scanf("%d",&tp);
        if(size==0)
        {
            a[0] = tp;
            size++;
        }else{
            int x =lower_bound(a,a+size,tp) - a ;
            if(x==size)a[size++] = tp;
            else a[x] = tp;
        }
    }
    printf("%d\n",size);
    return 0;
}