Cod sursa(job #814790)

Utilizator catalin.ichimovIchimov Catalin Florin catalin.ichimov Data 16 noiembrie 2012 04:18:00
Problema Subsir crescator maximal Scor 0
Compilator c Status done
Runda Arhiva educationala Marime 0.87 kb
#include<cstdio>
const int nmax=100001;
int a[nmax],p[nmax],q[nmax],n,i,j,k;
int caut(int ls,int ld,int x)
{
    while (ls<=ld)
	{
          int mij=(ls+ld)/2;
          if (q[mij]>=x && q[mij-1]<x)
			  return mij;
          if (q[mij]<x)
			  ls=mij+1;
                   else
					   ld=mij-1;
          }
    return ++k;
    }
void scrie(int i,int k)
{
     if (k>0)
	 {
      if (p[i]==k)
	  {
		  scrie(i-1,k-1);
                    printf("%d ",a[i]);}
             else
				 scrie(i-1,k);
      }
     }
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;
    for (i=1;i<=n;i++)
		{
			j=caut(1,k,a[i]);
                        q[j]=a[i];
                        p[i]=j;
	}
    printf("%d\n",k);
    scrie(n,k);
    return 0;
    }