Pagini recente » Cod sursa (job #1279447) | Cod sursa (job #2002744) | Cod sursa (job #2224175) | Cod sursa (job #1274491) | Cod sursa (job #2967560)
/*
Lefter Sergiu - 19/01/2023
*/
#include <fstream>
using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");
const int N = 100000;
int n, pmax = 1, nValMin, a[N + 1], lung[N + 1], valMin[N + 1];
int cautBin(int v[], int sz, int val) {
int st = 1, dr = sz, rez = 0;
while(st <= dr) {
int m = (st + dr) / 2;
if(v[m] < val) {
rez = m;
st = m + 1;
}
else {
dr = m -1;
}
}
return rez;
}
void refacSubsirul(int p, int val, int l) {
if (l == 1) {
return;
}
if (a[p] < val && lung[p] == l - 1) {
refacSubsirul(p - 1, a[p], lung[p]);
out << a[p] << " ";
}
else {
refacSubsirul(p - 1, val, l);
}
}
int main() {
in >> n;
for (int i = 1; i <= n; ++i) {
in >> a[i];
int lJ = cautBin(valMin, nValMin, pmax);
if (lJ == nValMin) {
nValMin++;
}
lung[i] = 1 + lJ;
valMin[lung[i]] = a[i];
if (lung[i] > lung[pmax]) {
pmax = i;
}
}
out << lung[pmax] << '\n';
refacSubsirul(pmax, a[pmax] + 1, lung[pmax] + 1);
in.close();
out.close();
return 0;
}