Pagini recente » Cod sursa (job #2605997) | Cod sursa (job #35150) | Cod sursa (job #1504654) | Cod sursa (job #1347985) | Cod sursa (job #2037395)
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
const int MaxN = 100001;
int a[MaxN];
int v[MaxN];
int p[MaxN];
int sol[MaxN];
int n;
int Lmax;
void ReadArray();
void WriteSolution();
int CautareBinara(int val);
void Sclm();
int main()
{
v[0] = -0x3f3f3f;
ReadArray();
Sclm();
WriteSolution();
}
void ReadArray()
{
fin >> n;
for (int i = 1; i <= n; ++i)
fin >> a[i];
}
void WriteSolution()
{
fout << Lmax << '\n';
int k = Lmax, j = 0;
for (int i = n; i >= 1; --i)
if (p[i] == k)
{
sol[++j] = a[i];
k--;
}
for (int i = Lmax; i >= 1; --i)
fout << sol[i] << ' ';
}
int CautareBinara(int val)
{
if (val > v[Lmax])
return Lmax + 1;
int l = 1, r = Lmax, m, poz = 1;
while (l <= r)
{
m = (l + r) / 2;
if (val < v[m])
{
r = m - 1;
poz = m;
}
else
l = m + 1;
}
return poz;
}
void Sclm()
{
for (int i = 1; i <= n; ++i)
{
int poz = CautareBinara(a[i]);
v[poz] = a[i];
p[i] = poz;
if ( poz > Lmax )
Lmax = poz;
}
}