Pagini recente » Istoria paginii utilizator/oveeh | Cod sursa (job #401037) | Cod sursa (job #2110725) | Statistici Kiss Darius Catalin (KissDarius) | Cod sursa (job #1351444)
#include <iostream>
#include <fstream>
#include <cstdio>
using namespace std;
ofstream g("scmax.out");
int l[100001],b[100001],poz,i,nr,n,a[100001],p[100001],maxim;
void afis(int i)
{
if (p[i] > 0) afis(p[i]);
g<<a[i]<<" ";
}
int cauta(int x)
{
int u,p,m;
p=0;
u=nr;
m=(p+u)/2;
while(p<=u)
{
if(a[l[m]]<x&&a[l[m+1]]>=x) return m;
else if(a[l[m+1]]<x) {p=m+1;m=(p+u)/2;}
else {u=m-1;m=(p+u)/2;}
}
return nr;
}
int main()
{
freopen("scmax.in","r",stdin);
scanf("%d",&n);
for(i=1;i<=n;i++) scanf("%d",a+i);
b[1]=l[1]=1;
l[0]=0;
nr=1;
for(i=2;i<=n;i++)
{
poz=cauta(a[i]);
p[i]=l[poz];
b[i]=poz+1;
l[poz+1]=i;
if(poz+1>nr) nr=poz+1;
}
maxim=0;
for(i=1;i<=n;i++)
{
if(b[i]>maxim)
{
maxim=b[i];
poz=i;
}
}
g<<maxim<<'\n';
afis(poz);
return 0;
}