Pagini recente » Cod sursa (job #2153469) | Cod sursa (job #1351414) | Cod sursa (job #1543804) | Cod sursa (job #2352953) | Cod sursa (job #1764761)
#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], maxim, k, sir[NMAX], nr;
void afis(int 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;
}
maxim = best[1];
for (i = 2; i <= N; i++)
maxim=max(maxim,best[i]);
g<<maxim<<endl;
for(i=1; i<=maxim; i++)
g<<v[sir[i]]<<' ';
return 0;
}