Pagini recente » Cod sursa (job #2160104) | Cod sursa (job #2614486) | Cod sursa (job #2462895) | tema | Cod sursa (job #1953626)
#include <fstream>
#define scmax 100003
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
unsigned n, v[scmax], best[scmax], p[scmax], maxim, k, L[scmax], nr = 1;
void afisare(unsigned i)
{
if (p[i] > 0)
afisare(p[i]);
fout << v[i] << ' ';;
}
unsigned cautare(unsigned x)
{
unsigned p = 0, u, m;
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()
{
unsigned i, poz;
fin >> n;
for (i = 1; i <= n; i++)
fin >> v[i];
best[1] = L[1] = 1;
L[0] = 0;
for (i = 2; i <= n; i++){
poz = cautare(v[i]);
p[i] = L[poz];
best[i] = poz + 1;
L[poz + 1] = i;
if (nr < poz + 1)
nr = poz + 1;
}
for (i = 1; i <= n; i++)
if (maxim < best[i]){
maxim = best[i];
poz = i;
}
fout << maxim << '\n';
afisare(poz);
fout << '\n';
fin.close();
fout.close();
return 0;
}