Pagini recente » Cod sursa (job #2256151) | Cod sursa (job #366549) | Cod sursa (job #3121949) | Cod sursa (job #3128069) | Cod sursa (job #1681495)
#include <iostream>
#include <fstream>
#include <algorithm>
#include <stack>
#include <limits.h>
using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");
int v[100003];
int t[100003];
int f[100003];
int p[100003];
int k;
int n;
void afis(int i) {
if(p[i] != 0)
afis(p[i]);
out << v[i] << " ";
}
int main() {
in >> n;
int mx = 0;
int poz;
for(int i = 1; i <= n; i++) {
in >> v[i];
poz = upper_bound(t+1, t+k+1, v[i])-t;
if(t[poz-1] == v[i])
poz--;
if(poz > k) {
mx = i;
k++;
}
p[i] = f[poz-1];
f[poz] = i;
t[poz] = v[i];
}
out << k << '\n';
afis(mx);
return 0;
}