Cod sursa(job #2131416)

Utilizator andreigeorge08Sandu Ciorba andreigeorge08 Data 14 februarie 2018 18:15:03
Problema Subsir crescator maximal Scor 65
Compilator cpp Status done
Runda Arhiva educationala Marime 0.9 kb
#include <bits/stdc++.h>

using namespace std;

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

int n, a[100005], lis[100005], k;

void Citire()
{
    fin >> n;
    for(int i = 1; i <= n; i++)
        fin >> a[i];

}
void CautBin(int x)
{
    if(x > lis[k])
    {
        lis[++k] = x;
        return;
    }
    if(x < lis[1])
    {
        lis[1] = x;
        return;
    }

    int st = 1, dr = k, mij, poz = 1;

    while(st <= dr)
    {
        mij = (st + dr) / 2;
        if(x <= lis[mij]){
            poz = mij;
            dr = mij - 1;
        }
        else st = mij + 1;
    }

    lis[poz] = x;
}
void Rez()
{
    k = 1;
    lis[1] = a[1];
    for(int i = 2; i <= n; i++)
        CautBin(a[i]);
    fout << k << "\n";

    for(int i = 1; i <= k; i++)
        fout << lis[i] << " ";
}
int main()
{
    Citire();
    Rez();
    return 0;
}