#include"bits/stdc++.h"
#define ll long long
#define pi pair<int,int>
#define inf 0x3f3f3f3f
#define _for(i,a,b) for(int i=a;i<=b;i++)
#define for_(i,a,b) for(int i=a;i<b;i++)
#define _fr(i,a,b) for(int i=a;i>=b;i--)
#define fr_(i,a,b) for(int i=a;i>b;i--)
#define IOS ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std;
const int N =1e5+5;
const ll mod = 1000000007;
const double lo=1.000000011;
int a[N],len[N];
void solve(){
int n,m;
while (cin >> n){
_for(i,1,n) cin >> a[i];
int ans = 0;
len[0] = -2e9;
_for(i,1,n){
int l = 0 , r = ans;
while (l <= r){
int mid = (l+r)/2;
if(len[mid] < a[i]){
l = mid +1 ;
}else{
r = mid -1;
}
}
ans = max(ans,r+1);
len[r+1]=a[i];
}
cout << ans << endl;
}
}
int main()
{
IOS;
solve();
return 0;
}
最长上升子序列
最新推荐文章于 2024-10-02 08:00:00 发布