Pagini recente » Cod sursa (job #1381202) | Cod sursa (job #2666154) | Cod sursa (job #415070) | Cod sursa (job #2424839) | Cod sursa (job #3191400)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int a[100001], top[100005], pre[100005], afis[100005];
int main() {
int n, k = 1;
fin >> n;
for (int i = 1; i <= n; i++)
fin >> a[i];
top[1] = 1;
for (int i = 2; i <= n; i++) {
int st = 1, dr = k;
if (a[i] > a[top[dr]]) {
pre[i] = top[dr];
top[++k] = i;
}
else {
int sol = 1;
while (st <= dr) {
int m = (st + dr) / 2;
if (a[i] <= a[top[m]]) {
sol = m;
dr = m - 1;
}
else
st = m + 1;
}
top[sol] = i;
pre[i] = top[sol - 1];
}
}
fout << k << "\n";
int nr = 0;
for (int i = top[k]; i != 0; i = pre[i])
afis[++nr] = a[i];
for (int i = nr; i >= 1; i--)
fout << afis[i] << " ";
return 0;
}