Cod sursa(job #1851239)

Utilizator FilimonAnaFilimon Ana-Maria FilimonAna Data 19 ianuarie 2017 15:52:14
Problema Subsir crescator maximal Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.01 kb
#include<fstream>
using namespace std;
int n, v[100003], best[100003], p[100003], maxim, k, L[100003], nr;
 
   ifstream f1("scmax.in");
   ofstream f2("scmax.out");
 
void afis(int i)
{
   if (p[i] > 0)  afis(p[i]);
   f2<<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()
{
 
   int i, j, poz;
   nr = 1;
 
   f1>>n;
   for (i = 1; i <= n; i++)
    f1>>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;
       }
   f2<<maxim<<'\n';
   afis(poz);
   return 0;
}