LIS（单调队列优化 C++ 版）（施工ing）

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

 const int MaxN=;

 int n,i,top=,x,stack[MaxN];

 int main(){
     cin>>n;
     stack[top]=-;
     for(i=;i<=n;i++){
         cin>>x;
         if(x>stack[top]){stack[++top]=x;}
         else
         {
             int low=,high=top,mid;
             while(low<high){
                 mid=(low+high)>>;
                 if(x>stack[mid])
                     low=mid+;
                 else
                     high=mid-;
             }
             stack[low]=x;
         }
     }
     cout<<top;
     return ;
 }