896. 最长上升子序列 II

思路：
大佬题解

代码：

# include<iostream>
# include<algorithm>
using namespace std;

const int N = 100010;
int a[N];
int q[N];
int n;

int main()
{
    scanf("%d",&n);
    for(int i = 0;i < n;i++) scanf("%d",&a[i]);
    
    q[0] = -2e9;//省得考虑边界
    int len = 0;
    for(int i = 0;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;
        }
        len = max(len,r + 1);
        q[r + 1] = a[i];
    }
    printf("%d\n",len);
    
    
    return 0;
}