Cod sursa(job #1650119)

Utilizator justsomedudePalade Thomas-Emanuel justsomedude Data 11 martie 2016 16:41:31
Problema Subsir crescator maximal Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.5 kb
#include <bits/stdc++.h>
#define nmax 100002
using namespace std;

int a[nmax], lis[nmax], poz[nmax], n, k, rez[nmax];

void Citire()
{
    int i;
    ifstream fin("scmax.in");
    fin >> n;
    for (i = 1; i <= n; i++)
        fin >> a[i];
    fin.close();
}

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

void LIS()
{
    int i, x, p;
    lis[1] = a[1];
    k = 1;
    poz[1] = 1;

    for (i = 2; i <= n; i++)
    {
        x = a[i];
        if (x > lis[k])
        {
            lis[++k] = x;
            poz[i] = k;
        }
        else if (x <= lis[1])
        {
            lis[1] = x;
            poz[i] = 1;
        }
        else
        {
            /// caut in lis[1..k] cea mai din stanga pozitie p cu x <= lis[p]
            p = CautBin(x);
            lis[p] = x;
            poz[i] = p;
        }
    }

}

void Afisare()
{
    int i, L;
    ofstream fout("scmax.out");
    fout << k << "\n";
    L = k;

    for (i = n; i >= 1 && L > 0; i--)
        if (poz[i] == L)
        {
            rez[L] = a[i];
            L--;
        }

    for (i = 1; i <= k; i++)
        fout << rez[i] << " ";

    fout << "\n";
    fout.close();
}

int main()
{
    Citire();
    LIS();
    Afisare();
    return 0;
}