Pagini recente » Cod sursa (job #3334035) | Cod sursa (job #3320035) | Cod sursa (job #487006) | Borderou de evaluare (job #3331521) | Cod sursa (job #2376479)
#include <iostream>
#include <stdio.h>
using namespace std;
int lmax,mmax,v[100005],i,a[100005],n;
int caut (int x){
int mij,p,u;
p=1;
u=n;
while(p<=u){
mij=(p+u)/2;
if(x>a[mij]) p=mij+1;
else u=mij-1;
}
return u;
}
int main()
{
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++) {scanf("%d",&v[i]);mmax=max(mmax,v[i]);}
for(i=1;i<=n;i++) a[i]=mmax+1;
for(i=1;i<=n;i++){
int p=caut(v[i]);
if(v[i]<a[p+1]) a[p+1]=v[i];
if(p+1>=lmax) lmax=p+1;
}
printf("%d\n",lmax);
// for(i=1;i<)
return 0;
}