Pagini recente » Cod sursa (job #2829232) | Cod sursa (job #1923764) | Cod sursa (job #1913840) | Cod sursa (job #1882445) | Cod sursa (job #1764769)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
const int NMAX=100003;
int N, v[NMAX], best[NMAX], ult[NMAX], Lmax, k, sir[NMAX], nr;
void afis(int i)
{
if(ult[i])
afis(ult[i]);
g<<v[i]<<' ';
}
int caut(int x)
{
int p, u, m;
p = 0;
u = nr;
m = (p+u)/2;
while (p <= u)
{
if (v[sir[m]] < x && v[sir[m+1]] >= x)
return m;
else if (v[sir[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;
f>>N;
for (i = 1; i <= N; i++)
f>>v[i];
best[1] = sir[1] = 1;
sir[0] = 0;
for (i = 2; i <= N; i++)
{
poz = caut(v[i]);
ult[i] = sir[poz];
best[i] = poz + 1;
sir[poz + 1] = i;
if (nr < poz + 1)
nr = poz + 1;
}
Lmax = best[1];
for (i = 2; i <= N; i++)
//Lmax=max(Lmax,best[i]);
if (Lmax < best[i])
{
Lmax = best[i]; poz = i;
}
g<<Lmax<<endl;
afis(poz);
//for(i=1; i<=Lmax; i++)
// g<<v[sir[i]]<<' ';
return 0;
}