Cod sursa(job #303881)

Utilizator cristiprgPrigoana Cristian cristiprg Data 10 aprilie 2009 14:23:19
Problema Subsir crescator maximal Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 2.17 kb
/*#include <cstdio>
#define DIM 100005
int n, v[DIM], p[DIM], M[DIM], L;
FILE *out = fopen("scmax.out", "w");

void afis(int i)
{
	if (p[i] != 0)
		afis(p[i]);

	if (p[i] != 0)
	fprintf(out, "%d ", v[p[i]]);
}


int max(int a, int b)
{
	if (a > b)
		return a;
	else
		return b;
}

int caut(int x)
{
	int p = 0, u = L, m = (p + u + 1) / 2;

	while (p <= u)
	{
		if (v[M [ m - 1 ]] < x && v[M [m + 1]] >= x)
			return m;

		if (v[M [m + 1]] < x)
			p = m + 1, m = (p + u ) / 2;

		else
			u = m - 1, m = (p + u) / 2;
	}
	if(u == -1)
		return 0;

	return L;
}

void solve()
{
	v[0] = 1<<30;
	int i, j;
	for (i = 1; i <= n; i++)
	{
		j = caut(v[i]);
		p[i] = M[j];
		if (j == L || v[i] < v[ M [ j + 1] ])
			M[j + 1] = i, L = max (L, j + 1);
	}
}



int main()
{
	FILE *f =fopen("scmax.in", "r");
	fscanf(f, "%d", &n);
	int i;
	for (i = 1; i <= n; i++)
		fscanf(f, "%d", &v[i]);
	fclose(f);

	solve();


	fprintf(out, "%d\n", L);
	int maxim = -1, ibun;
	for (i = 1; i <=n; i++)
		if (p[i] > maxim)
			maxim = p[i], ibun = i;
	afis(ibun);
	fprintf(out, "%d", v[M[L]]);
	fclose(out);
	return 0;

}
*/


#include <stdio.h>
int n, v[100003], best[100003], p[100003], maxim, k, L[100003], nr;

void afis(int i)
{
   if (p[i] > 0)  afis(p[i]);
   printf("%d ",v[i]);
}

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

int main()
{
   freopen("scmax.in","r",stdin);
   freopen("scmax.out","w",stdout);
   int i, j, poz;
   nr = 1;

   scanf("%d",&n);
   for (i = 1; i <= n; i++) scanf("%d", v + i);
   best[1] = L[1] = 1; L[0] =  0;

   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;
}