Increasing Subsequence

#include <bits/stdc++.h>
using namespace std;
#define rep(k,z) for(int i=k;i<z;i++)
#define ll  long long int
const ll MOD=1e9+7;
  
int main()
{
	  int n;
    cin>>n;
    vector<int> dp;
    for(int i=0;i<n;i++)
    {
        int k;
        cin>>k;
        int len=dp.size();
        if(len==0 || dp[len-1]<k)
        {
         dp.push_back(k);
        }
        else
        {
        int l=0,h=len-1;
        int idx=0;
            while(l<=h)
            {
              int mid=l+(h-l)/2;
              if(dp[mid]>=k)
              {
                  idx=mid;
                  h=mid-1;
              }
              else
              l=mid+1;
            }
        dp[idx]=k;  
        
        }
    }
 
    cout<<dp.size()<<endl;
}