Cod sursa(job #413352)

Utilizator Cristi09Cristi Cristi09 Data 8 martie 2010 11:05:24
Problema Subsir crescator maximal Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.99 kb
#include <stdio.h>   
int n, v[100003], best[100003], p[100003], maxim, k, M[100003], nr;
FILE*g=fopen("scmax.out","w");
void afis(int i)
{
   if (p[i] > 0)  afis(p[i]);
   fprintf(g,"%d ",v[i]);
}

int caut(int x)
{
   int p, u, m;
   p = 0; u = nr; m = (p+u)/2;
   while (p <= u)
   {
      if (v[M[m]] < x &&  v[M[m+1]] >= x) return m;
      else if (v[M[m+1]] < x) {p = m + 1; m = (p + u)/2;}
      else {u = m - 1; m = (p + u)/2;}
   }
   return nr;
}

int main()
{
   FILE*f=fopen("scmax.in","r");
   int i, poz,maxP;
   nr = 1;

   fscanf(f,"%d",&n);
   for (i=1;i<=n;i++)
	   fscanf(f,"%d", &v[i]);
   fclose(f);
   best[1]=M[1]=1;
   M[0]=0;
	maxim=1;maxP=1;
   for (i=2;i<=n;i++)
   {
      poz=caut(v[i]);
      p[i]=M[poz];
      best[i]=poz + 1;
	  if (maxim < best[i])
       {
          maxim = best[i]; maxP = i;
       }
      M[poz+1]=i;
      if(nr<poz+1)nr=poz+1;
   }
   fprintf(g,"%d\n",maxim);
   afis(maxP);
   fclose(g);
   return 0;   
}