Cod sursa(job #3290327)

Utilizator seby1337Goran Sebastian-Alexandru seby1337 Data 30 martie 2025 12:43:31
Problema Subsir crescator maximal Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.4 kb
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define pi pair<int, int>
#define all(v) v.begin(), v.end()
using namespace std;

const string file = "scmax";
ifstream fin(file+".in");
ofstream fout(file+".out");

const int dim = 1e5+5;
int n, i, a[dim], dp[dim], l, last_ind[dim];
vector<int> poz[dim];

int main()
{
    fin >> n;
    for (i = 1; i <= n; i++)
        fin >> a[i];
    l = 0;
    dp[0] = 0;
    int st, dr, mij, p;
    for (i = 1; i <= n; i++)
    {
        if (dp[l] < a[i])
            dp[++l] = a[i], poz[l].pb(i);
        else
        {
            st = 1, dr = l, mij, p = l;
            while (st <= dr)
            {
                mij = (st+dr)/2;
                if (dp[mij-1] < a[i])
                    p = mij, st = mij+1;
                else
                    dr = mij-1;
            }
            if (dp[p-1] < a[i] && a[i] < dp[p])
                dp[p] = a[i], poz[p].pb(i);
        }
    }
    fout << l << '\n';
    vector<int> sir;
    sir.pb(dp[l]);
    int ind = poz[l].back();
    while (l > 1)
    {
        //cout << "l ind = " << l << ' ' << ind << endl;
        auto it = lower_bound(all(poz[l-1]), ind);
        it--;
        sir.pb(a[(*it)]);
        ind = (*it);
        l--;
    }
    reverse(all(sir));
    for (auto x : sir)
        fout << x << ' ';
    return 0;
}