Cod sursa(job #928938)
#include<cstdio>
#define nmax 100003
using namespace std;
int N, a[nmax], sol[nmax], L[nmax];
int i,l,r,m,poz,k,j;
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; // SAU CEVA FOARTE MIC
for(i=1; i<=N; ++i)
{
if(a[i] > sol[k]) sol[++k] = a[i], L[i]=k;
else
{
//caut binar poz. celui mai mic sol[] < a[i]
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;
}