Pagini recente » Cod sursa (job #2116924) | Cod sursa (job #654992) | Cod sursa (job #1571793) | Cod sursa (job #1926351) | Cod sursa (job #1132980)
#include<cstdio>
using namespace std;
int n,a[100003],sol[100003],L[100003];
int il,l,r,m,poz,k,j,i;
int main()
{
freopen("scmax.in", "r", stdin);
freopen("scmax.out", "w", stdout);
scanf("%d",&n);
for (i=1;i<=n;++i)
scanf("%d",&a[i]);
k=0;
sol[0]=0;
for (i=1; i<=n; ++i)
{
if (a[i]>sol[k])
{
sol[++k]=a[i];
L[i]=k;
}
else
{
l=1,r=k,poz=k;
while (l<=r)
{
m=(l+r)/2;
if (sol[m]<a[i]) l=m+1;
else poz=m,r=m-1;
}
sol[poz]=a[i];
L[i]=poz;
}
}
printf("%d\n",k);
for (i=n, j=0; i>0 && k; --i)
if (L[i]==k) sol[++j]=a[i],--k;
for (i=j; i>0; --i)
printf("%d ",sol[i]);
return 0;
}