Pagini recente » Cod sursa (job #1945487) | Cod sursa (job #2606495) | Cod sursa (job #531536) | Cod sursa (job #1008783) | Cod sursa (job #1469208)
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
const int MAX = 100001;
const int inf = (1 << 31) - 1;
int n, sol, poz[MAX], c[MAX], v[MAX];
vector <int> s;
int main() {
fin >> n;
for (int ind, i = 1; i <= n; i++) {
fin >> v[i];
c[i] = inf;
ind = lower_bound(c + 1 ,c + i + 1, v[i]) - c;
poz[i] = ind;
c[ind] = v[i];
sol = max(sol, ind);
}
fout << sol << '\n';
for (int i = n; i >= 1 && sol; i--)
if (poz[i] == sol){
s.push_back(v[i]);
sol--;
}
while(s.size()){
fout << s.back() << ' ';
s.pop_back();
}
return 0;
}