Cod sursa(job #3285313)

Utilizator CimpoesuFabianCimpoesu Fabian George CimpoesuFabian Data 12 martie 2025 18:10:20
Problema Subsir crescator maximal Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.11 kb
#include <bits/stdc++.h>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");

int n, a[100001], v[100001], pos[100001], k, sol[100001];

int Cautare(int x)
{
    int st, dr, m, val;
    st = 1; dr = k;
    val = k;
    while (st <= dr)
    {
        m = (st + dr) / 2;
        if (x <= v[m])
        {
            val = m;
            dr = m - 1;
        }
        else st = m + 1;
    }
    return val;
}

int main()
{
    int cop, i, val, P;
    fin >> n;
    for (i = 1 ; i <= n ; i++)
        fin >> a[i];
    v[1] = a[1];
    k = 1;
    pos[1] = 1;
    for (i = 2 ; i <= n ; i++)
    {
        val = a[i];
        if (val > v[k])
        {
            v[++k] = val;
            pos[i] = k;
        }
        else
        {
            P = Cautare(val);
            v[P] = val;
            pos[i] = P;
        }
    }
    fout << k << "\n";
    cop = k;
    for (i = n ; i >= 1 && cop > 0 ; i--)
        if (pos[i] == cop)
    {
        sol[cop] = a[i];
        cop--;
    }
    for (i = 1 ; i <= k ; i++)
        fout << sol[i] << " ";
    return 0;
}