Pagini recente » Cod sursa (job #2368003) | Cod sursa (job #3033128) | Cod sursa (job #1009805) | Cod sursa (job #244265) | Cod sursa (job #2208478)
#include<bits/stdc++.h>
#define ll long long
#define sz size
#define pb push_back
#define er erase
#define in insert
#define fr first
#define sc second
#define mp make_pair
#define pi pair
#define _ ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
#define rc(s) return cout<<s,0
using namespace std;
int n,x;
vector<int>ans;
int binsearch(int l,int r,int y){
int mid;
while(l<=r){
mid=l+(r-l)/2;
if(ans[mid]<y) l=mid+1;
else r=mid-1;
}
mid=l+(r-l)/2;
if(ans[mid]>y) mid--;
return mid;
}
signed main(){
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
cin >> n;
while(n--){
cin >> x;
if(!ans.size()){ ans.push_back(x); continue;}
if(x>ans[ans.size()-1]){ ans.pb(x); continue;}
int ho=binsearch(0,ans.size()-1,x);
ans[ho+1]=x;
}
cout<<ans.size();
}