Mai intai trebuie sa te autentifici.
Cod sursa(job #2037469)
Utilizator | Data | 12 octombrie 2017 11:48:19 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.3 kb |
#include <fstream>
std::ifstream fin("scmax.in");
std::ofstream fout("scmax.out");
const int MaxN = 100001, Inf = 0x3f3f3f3f;
int n, Lmax;
int a[MaxN];
int v[MaxN];
int p[MaxN];
int sol[MaxN];
void ReadArray();
void Cmlsc();
int BinarySearch(int val);
void WriteArray();
int main()
{
v[0] = -Inf;
ReadArray();
Cmlsc();
WriteArray();
fin.close();
fout.close();
}
void ReadArray()
{
fin >> n;
for (int i = 1; i <= n; ++i)
fin >> a[i];
}
int BinarySearch(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])
{
poz = m;
r = m - 1;
}
else
l = m + 1;
}
return poz;
}
void Cmlsc()
{
for (int i = 1; i <= n; ++i)
{
int poz = BinarySearch(a[i]);
v[poz] = a[i];
p[i] = poz;
if (poz > Lmax)
Lmax = poz;
}
}
void WriteArray()
{
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] << ' ';
}