Pagini recente » Cod sursa (job #1980075) | Cod sursa (job #2286351) | Cod sursa (job #1090566) | Cod sursa (job #175793) | Cod sursa (job #1164082)
#include <cstdio>
int n,v[100003],a[100003],b[100003],maxx,k,L[100003],nr,numar;
void afis(int i)
{
if(b[i]>0)
afis(b[i]);
printf("%d ",v[i]);
}
int caut(int x)
{
int p,u,m;
p=0;
u=nr;
m=(p+u)/2;
while(p<=u)
{
if(v[L[m]]<x&&v[L[m+1]]>=x)
return m;
else
{
if (v[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);
freopen("scmax.out","w",stdout);
nr=1;
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d",v[i]);
}
a[1]=L[1]=1;L[0]=0;
for(int i=2;i<=n;i++)
{
numar=caut(v[i]);
b[i]=L[numar];
a[i]=numar+1;
L[numar+1]=i;
if (nr<numar+1)
{
nr=numar+1;
}
}
maxx=0;numar=0;
for(int i=1;i<=n;i++)
if(maxx<a[i])
{
maxx=a[i];numar=i;
}
printf("%d\n",maxx);
afis(numar);
return 0;
}