Pagini recente » Cod sursa (job #2391671) | Cod sursa (job #873990) | Cod sursa (job #2497355) | Cod sursa (job #2094291) | Cod sursa (job #1147235)
#include<cstdio>
using namespace std;
int n,i,ma,m,ls,ld,p1,z,a[100001],b[100001],l[100001],p[100001],s[100001];
int main()
{
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
scanf("%d",&n);
scanf("%d",&a[1]);
b[1]=1;
l[1]=1;
ma=1;
p1=1;
for(i=2;i<=n;i++)
{
scanf("%d",&a[i]);
ls=1;
ld=ma;
z=0;
while(ls<=ld)
{
m=(ls+ld)/2;
if(a[l[m]]<a[i])
{
if(a[l[m+1]]>a[i]||a[l[m+1]]==0)
{
z=m;
break;
}
else ls=m+1;
}
else
{
if(a[l[m-1]]<a[i])
{
z=m-1;
break;
}
else ld=m-1;
}
}
b[i]=z+1;
p[i]=l[z];
if(a[l[z+1]]>a[i])l[z+1]=i;
if(l[z+1]==0)l[z+1]=i;
if(ma<z+1){ma=z+1;p1=i;}
}
m=ma;
while(p1>0)
{
s[ma]=a[p1];
p1=p[p1];
ma--;
}
printf("%d\n",m);
for(i=1;i<=m;i++)
{
printf("%d ",s[i]);
}
return 0;
}