Cod sursa(job #2775579)

Utilizator BogdanRazvanBogdan Razvan BogdanRazvan Data 16 septembrie 2021 14:24:25
Problema Subsir crescator maximal Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.03 kb
#include <bits/stdc++.h>

using namespace std;

ifstream fin ("scmax.in");
ofstream fout ("scmax.out");

void usain_bolt()
{
    ios::sync_with_stdio(false);
    fin.tie(0);
}

const int N = 1e5 + 5;

int a[N], f[N], dad[N];

void path(int k)
{
    if(dad[k] != 0) {
        path(dad[k]);
    }
    fout << a[k] << " ";
}

int bs(int x)
{
    int left = 1, right = f[N - 1], mx = 0;
    while(left <= right) {
        int mid = (left + right) >> 1;
        if(x > a[f[mid]]) {
            mx = max(mx, mid);
            left = mid + 1;
        }
        else {
            right = mid - 1;
        }
    }
    return mx;
}

int main()
{
    usain_bolt();

    int n;

    fin >> n;
    for(int i = 1; i <= n; ++i) {
        fin >> a[i];
    }
    f[++f[N - 1]] = 1;
    for(int i = 2; i <= n; ++i) {
        int pos = bs(a[i]);
        f[pos + 1] = i;
        dad[i] = f[pos];
        f[N - 1] = max(f[N - 1], pos + 1);
    }
    fout << f[N - 1] << "\n";
    path(f[f[N - 1]]);
    return 0;
}