Pagini recente » Cod sursa (job #1863372) | Cod sursa (job #2867994) | Cod sursa (job #2094628) | Cod sursa (job #625098) | Cod sursa (job #3347654)
#include <bits/stdc++.h>
int n,v[100003],p[100003],L[100003],nr;
void afis(int i)
{
if(p[i]>0)
afis(p[i]);
printf("%d ",v[i]);
}
int caut(int x)
{
int st=1,dr=nr,ans=nr+1;
while(st<=dr)
{
int m=(st+dr)/2;
if(v[L[m]]>=x)
{
ans=m;
dr=m-1;
}
else
st=m+1;
}
return ans;
}
int main()
{
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&v[i]);
nr=0;
for(int i=1; i<=n; i++)
{
int poz=caut(v[i]);
if(poz==1)
p[i]=0;
else
p[i]=L[poz-1];
L[poz]=i;
if(poz>nr)
nr=poz;
}
printf("%d\n",nr);
afis(L[nr]);
return 0;
}