Cod sursa(job #1752012)

Utilizator BlackNestaAndrei Manaila BlackNesta Data 2 septembrie 2016 15:43:27
Problema Subsir crescator maximal Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.36 kb
#include <bits/stdc++.h>
#define Nmax 100005

using namespace std;

int n, a[Nmax], lis[Nmax], poz[Nmax], k;

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

int CautBin(int k, int x)
{
    if(x <= lis[1]) return 1;
    if(x > lis[k]) return k + 1;
    for(int i = 2; i <= k; i++)
        if(x == lis[i]) return 0;
    int p = 1;
    int st = 1;
    int dr = k;
    while(st <= dr)
    {
        int mij = (st + dr) / 2;
        if(x <= a[mij])
        {
            p = mij;
            dr = mij - 1;
        }
        else
            st = mij + 1;
    }
    return p;
}

void Lis()
{
    lis[1] = a[1];
    cout << lis[1] << "\n";
    poz[1] = 1;
    k = 1;
    for(int i = 2; i <= n; i++)
    {
        int x = a[i];
        int p = CautBin(k, x);
        if(p > k)
        {
            lis[++k] = x;
            poz[i] = k;
        }
        else
        {
            lis[p] = x;
            poz[i] = p;
        }
        for(int j = 1; j <= k; j++)
            cout << lis[j] << " ";
        cout << "\n";
    }
}

void Afisare()
{
    ofstream g("scmax.out");
    g << k << "\n";
    for(int i = 1; i <= k; i++)
        g << lis[i] << " ";
    g.close();
}

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