Pagini recente » Cod sursa (job #2371442) | Cod sursa (job #1405651) | Cod sursa (job #989799) | Cod sursa (job #1542905) | Cod sursa (job #2723572)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
const int nmax = 100005;
int n, k;
int a[nmax], d[nmax], p[nmax], ind[nmax];
int main()
{
fin >> n;
for(int i = 1; i <= n; ++i)
{
fin >> a[i];
}
k = 1;
d[k] = a[1];
p[1] = 1;
for(int i = 2; i <= n; ++i)
{
if(a[i] > d[k])
{
d[++k] = a[i];
p[i] = k;
}
else
{
int st = 1, dr = k, poz = k + 1;
while(st <= dr)
{
int mij = (st + dr) / 2;
if(d[mij] > a[i])
{
poz = mij;
dr = mij - 1;
}
else st = mij + 1;
}
d[poz] = a[i];
p[i] = poz;
}
}
int j = n;
for(int i = k; i >= 1; --i)
{
while(p[j] != i)
--j;
ind[i] = j;
}
fout << k << "\n";
for(int i = 1; i <= k; ++i)
{
fout << a[ind[i]] << " ";
}
return 0;
}