Cod sursa(job #2516150)

Utilizator PaulOrasanPaul Orasan PaulOrasan Data 30 decembrie 2019 14:52:39
Problema Subsir crescator maximal Scor 20
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.37 kb
#include <fstream>

using namespace std;

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

const int NMAX=100005;

int n, v[NMAX], bestrun[NMAX], sol[NMAX];

void citire()
{
    fin>>n;
    for (int i=1; i<=n; i++)
        fin>>v[i];
}
void salvareSolutie()
{
    for (int i=0; i<=n; i++)
        sol[i]=bestrun[i];
}
bool cautareBinara(int x, int &pos)
{
    int st=1, dr=bestrun[0], mij=(st+dr)/2;
    if (bestrun[dr]<x)
        return false;
    while (st<=dr){
        if (bestrun[mij]==x){
            pos=mij;
            return true;
        }
        if (bestrun[mij]<x)
            st=mij+1;
        else
            dr=mij-1;
        mij=(st+dr)/2;
    }
    pos=st;
    return true;
}

void rezolvare()
{
    bestrun[0]=1;
    bestrun[1]=v[1];
    int p;
    for (int i=2; i<=n; i++){
        if (cautareBinara(v[i],p)){
            if (bestrun[0]>sol[0])
                salvareSolutie();
            bestrun[0]=p;
            bestrun[p]=v[i];
        }else{
            bestrun[0]++;
            bestrun[bestrun[0]]=v[i];
        }
    }
    if (bestrun[0]>sol[0])
        salvareSolutie();
}
void afisare()
{
    fout<<sol[0]<<'\n';
    for (int i=1; i<=sol[0]; i++)
        fout<<sol[i]<<' ';
}
int main()
{
    citire();
    fin.close();
    rezolvare();
    afisare();
    fout.close();
    return 0;
}