Pagini recente » Cod sursa (job #2741843) | Cod sursa (job #894345) | Cod sursa (job #2363349) | Cod sursa (job #1847770) | Cod sursa (job #2051005)
#include <fstream>
using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");
const int Nmax = 100003;
int n, k, nr, poz, maxim;
int v[Nmax], best[Nmax], p[Nmax], L[Nmax];
void afisare (int i)
{
if (p[i] != 0)
afisare (p[i]);
out << v[i] << ' ';
}
int caut (int x)
{
int p, u, m;
p = 0; u = nr; m = (p + u) / 2;
while (p <= u)
{
if (x > v[L[m]] && x <= v[L[m + 1]]) return m;
else
if (x > v[L[m + 1]])
{
p = m + 1;
m = (p + u) / 2;
}
else
{
u = m - 1;
m = (p + u) / 2;
}
}
return nr;
}
int main()
{
in >> n;
for (int i = 1; i <= n; i++)
in >> v[i];
best[1] = 1;
L[1] = 1;
L[0] = 0;
for (int i = 2; i <= n; i++)
{
poz = caut(v[i]);
p[i] = L[poz];
L[poz + 1] = i;
best[i] = poz + 1;
if (nr < poz + 1)
nr = poz + 1;
}
poz = 0;
for (int i = 1; i <= n; i++)
{
if (best[i] > maxim)
{
maxim = best[i];
poz = i;
}
}
out << maxim << '\n';
afisare (poz);
return 0;
}