Cod sursa(job #3344325)

Utilizator Radu_BicliBiclineru Radu Radu_Bicli Data 1 martie 2026 20:47:15
Problema Subsir crescator maximal Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.22 kb
#include <bits/stdc++.h>

using namespace std;

#define USE_STD_IO 0
#if USE_STD_IO
    #define fin cin
    #define fout cout
#else
    ifstream fin("scmax.in");
    ofstream fout("scmax.out");
#endif

int n, i, a[100002], sclm[100002], nr;
int ant[100002], lg[100002];

static inline int CautBin(int val) {
    int st = 0, dr = nr;
    int mij;

    while(st <= dr) {
        mij = st + (dr - st) / 2;
        if(a[sclm[mij]] < val && val <= a[sclm[mij + 1]]) return mij;
        if(a[sclm[mij + 1]] < val) st = mij + 1;
        else dr = mij - 1;
    }
    return nr;
}

static inline void Afis(int i) {
    if(0 < ant[i]) Afis(ant[i]);
    fout << a[i] << ' ';
}

int main() {
    if(USE_STD_IO) ios_base::sync_with_stdio(false);
    fin.tie(NULL);
    fout.tie(NULL);

    fin >> n;
    for(i = 1; i <= n; i++) fin >> a[i];

    nr = 1;
    lg[1] = sclm[1] = 1;
    for(i = 2; i <= n; i++) {
        int p = CautBin(a[i]);
        ant[i] = sclm[p];
        lg[i] = p + 1;
        sclm[p + 1] = i;
        nr = max(nr, p + 1);
    }

    int ma = 1;
    for(i = 2; i <= n; i++) {
       if(lg[ma] < lg[i]) ma = i;
    }

    fout << lg[ma] << '\n';
    Afis(ma);

    return 0;
}