Cod sursa(job #3259111)

Utilizator CimpoesuFabianCimpoesu Fabian George CimpoesuFabian Data 25 noiembrie 2024 10:55:58
Problema Subsir crescator maximal Scor 85
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.05 kb
#include <bits/stdc++.h>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");

/**
*/

int a[100002], dp[100002], n, k, poz[100002], sol[100002];

int CautBin(int x)
{
    if (x < dp[1]) return 1;
    int st, dr, mij, p;
    st = 1; dr = p = k;
    while (st <= dr)
    {
        mij = (st + dr) / 2;
        if (x < dp[mij])
        {
            p = mij;
            dr = mij - 1;
        }
        else st = mij + 1;
    }
    return p;
}

int main()
{
    int i, j, m;
    fin>>n;
    for(i=1;i<=n;i++)
        fin>>a[i];
    dp[1] = a[1]; k = 1;
    for (i = 2; i <= n; i++)
        if (dp[k] < a[i]) {dp[++k] = a[i]; poz[i] = k;}
        else
        {
            j = CautBin(a[i]);
            dp[j] = a[i];
            poz[i] = j;
        }
    fout << k << "\n";
    m = k;
    for (i = n ; i >= 1 ; i--)
    {
        if (poz[i] == m)
        {
            sol[m] = a[i];
            m--;
        }
    }
    for (i = 1 ; i <= k ; i++)
        fout << sol[i] << " ";
    return 0;
}