记录编号	569044	评测结果	AAAAAAAAAA
题目名称	最长上升子序列	最终得分	100
用户昵称	lihaoze	是否通过	通过
代码语言	C++	运行时间	0.000 s
提交时间	2022-02-13 23:31:40	内存使用	0.00 MiB

#include <iostream>
#include <vector>
#include <cstring>
#include <string>
#include <algorithm>
#define OPEN(_x) freopen(#_x".in", "r", stdin); freopen(#_x".out", "w", stdout)
#define ABS(_x) ((_x)<0?(-(_x)):(_x))
#define MAX(_a, _b) ((_a)<(_b)?(_b):(_a))
#define MIN(_a, _b) ((_a)>(_b)?(_b):(_a))
#define fi first
#define se second

using namespace std;

typedef long long ll;
typedef pair<int, int> PII;

namespace IO{
    template<typename T>
    inline T read() {
        T ret=0, sig=1; char ch=0;
        while(ch<'0'||ch>'9') { if(ch=='-') sig=-1; ch=getchar(); }
        while(ch>='0'&&ch<='9') { ret=(ret<<1)+(ret<<3)+ch-'0'; ch=getchar(); }
        return ret*sig;
    }
    template<typename T>
    inline void read(T &x) {
        T ret=0, sig=1; char ch=0;
        while(ch<'0'||ch>'9') { if(ch=='-') sig=-1; ch=getchar(); }
        while(ch>='0'&&ch<='9') { ret=(ret<<1)+(ret<<3)+ch-'0'; ch=getchar(); }
        x = ret*sig;
    }
    template<typename T>
    inline void write(T x) {
        if(x<0) putchar('-'), x=-x;
        T stk[100], tt=0;
        do stk[tt++]=x%10, x/=10; while(x);
        while(tt) putchar(stk[--tt]+'0');
    }
};

const int N = 1010;
int n;
int a[N];
int q[N];
int f[N];

int main() {
    #ifdef DEBUG
    OPEN(test);
    #endif
    OPEN(lis1);
    IO::read(n);
    for(register int i = 1; i<=n; ++i) IO::read(a[i]);
    int len = 0;
    q[0] = -1e9;
    for(register int i = 1; i<=n; ++i) {
        int l = 0, r = len;
        while(l < r) {
            int mid = l+r+1>>1;
            if(q[mid] < a[i]) l = mid;
            else r = mid-1;
        }
        q[r+1] = a[i];
        len = MAX(len, r+1);
    }
    IO::write(len);
    return 0;
}