Pagini recente » Cod sursa (job #820794) | Cod sursa (job #142697) | Cod sursa (job #246065) | Cod sursa (job #3129198) | Cod sursa (job #2795275)
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n, a[100005], v[100005], p[100005], lg, put = 1;
void citire() {
f >> n;
for (int i = 1; i <= n; i++)
f >> a[i];
}
int cautare_binara(int x) {
int i = 0;
for (int l = put; l > 0; l >>= 1)
if (i + l <= lg && x > v[i + l])
i += l;
return i + 1;
}
void parcurgere() {
v[0] = -1;
for (int i = 1; i <= n; ++i) {
int poz = cautare_binara(a[i]);
v[poz] = a[i];
p[i] = poz;
if (poz > lg) {
lg++;
if (put < lg)
put <<= 1;
}
}
}
void afisare() {
g << lg << '\n';
int afis[100005], aux = lg;
for (int i = n; i >= 1; --i)
if (p[i] == lg) {
afis[lg] = a[i];
lg--;
}
for (int i = 1; i <= aux; ++i)
g << afis[i] << ' ';
}
int main() {
citire();
parcurgere();
afisare();
return 0;
}