Cod sursa(job #2131369)

Utilizator VladimirPopa123Vladimir Popa VladimirPopa123 Data 14 februarie 2018 17:48:19
Problema Subsir crescator maximal Scor 65
Compilator cpp Status done
Runda Arhiva educationala Marime 0.85 kb
#include<fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
const int L=100000;
int v[L],lung[L],val[L],poz[L],pred[L],m;
int cautb(int);
void subsir(int);

int main()
{
    int n,l,k;
    fin>>n;
    for(int i=0;i<n;i++) fin>>v[i];
    for(int i=0;i<n;i++)
    {
        l=0;
        for(int j=0;j<i;j++)
            if(v[j]<v[i]) l=max(l,lung[j]);
        lung[i]=1+l;
    }
    m=0;
    for(int i=0;i<n;i++)
    {
        k=cautb(v[i]);
        if(k==m) m++;
        val[k+1]=v[i];
        poz[k+1]=i;
        lung[i]=k+1;
        pred[i]=poz[k];
    }
    fout<<m<<'\n';
    subsir(poz[m]);
    return 0;
}

int cautb(int x)
{
    int r=0,pas=1<<16;
    while(pas)
    {
        if(r+pas<=m&&val[r+pas]<x) r+=pas;
        pas/=2;
    }
    return r;
}

void subsir(int p)
{
    if(pred[p]!=0) subsir(pred[p]);
    fout<<v[p]<<' ';
}