最长严格上升子序列

这种水题博主就不多介绍了，不就是DP吗？但是，博主使用的是n log n的算法，大家仔细推敲一下就知道是栈了！

#include<iostream>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<algorithm>
#include<ctime>
#include<set>
#include<map>
#include<queue>
#include<vector>

using namespace std;

#define REP(i, a, b) for(int i = (a), _end_ = (b);i <= _end_; ++i)
#define mem(a) memset((a), 0, sizeof(a))
#define str(a) strlen(a)

const int maxn = 10010;

int n, m, k;

int a[maxn];

int main() {
    scanf("%d", &n);
    int top = 0;
    REP(i, 1, n) {
        scanf("%d", &k);
        if(a[top] < k)
            a[++top] = k;
        else {
            int l = 1, r = top;
            while(l < r) {
                int mid = (l + r) / 2;
                if(a[mid] >= k)
                    r = mid;
                else
                    l = mid + 1;
            }
            a[l] = k;
        }
    }
//  REP(i, 1, top)
//      printf("%d ", a[i]);
//  puts("");
    printf("%d\n", top);
    return 0;
}