Cod sursa(job #1217361)

Utilizator azkabancont-vechi azkaban Data 7 august 2014 09:32:16
Problema Subsir crescator maximal Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.99 kb
#include <cstdio>   
#define limit 100013
int n, v[limit],best[limit],p[limit],L[limit],i,maxim,k,j,poz,nr(1);
void openIOFiles()
{
 freopen("scmax.in","r",stdin);
 freopen("scmax.out","w",stdout);
}

void afis(int i)
{
 if (p[i]>0) afis(p[i]);
 printf("%d ",v[i]);
}
 
int caut(int x)
{
   int l(0), r(nr), m;
   while (l<=r)
   {
    m=(l+r)/2;
    if (v[L[m]] < x &&  v[L[m+1]] >= x) return m;
    if (v[L[m+1]] < x)  l=m+1;
                   else r=m-1;
   }
   return nr;
}
 
int main()
{
 openIOFiles();
 scanf("%d",&n);
 for (i=1;i<=n;++i) scanf("%d",&v[i]);
 L[0]=0;  
 best[1]=L[1]=1; 
 for (i=2;i<=n;++i){
                    poz=caut(v[i]);
                    p[i]=L[poz];
                    best[i]=poz+1;
                    L[poz + 1]=i;
                    if (nr<poz+1) nr=poz+1;
                   }
 maxim=0; poz=0;
 for (i=1;i<=n;++i)
   if (maxim < best[i])
      maxim = best[i],poz = i;
 printf("%d\n",maxim);
 afis(poz);
 return 0;   
}