Pagini recente » Cod sursa (job #2297864) | Cod sursa (job #2133860) | Cod sursa (job #1038872) | Cod sursa (job #1145796) | Cod sursa (job #3144714)
#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];
k++;
top[k] = i;
}
else {
int sol = 1;
while (st <= dr) {
int mid = (st + dr) / 2;
if (a[i] <= a[top[mid]]) {
sol = mid;
dr = mid - 1;
}
else
st = mid + 1;
}
top[sol] = i;
pre[i] = sol;
}
}
fout << k << "\n";
int tmp = top[k], nr = 0;
while (tmp != 0) {
afis[++nr] = a[tmp];
tmp = pre[tmp];
}
for (int i = nr; i >= 1; i--)
fout << afis[i] << " ";
return 0;
}