Cod sursa(job #2972480)

Utilizator TraianQTraianQ TraianQ Data 29 ianuarie 2023 16:11:20
Problema Subsir crescator maximal Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.86 kb
#include <fstream>
#include <vector>
using namespace std;
int v[100005];
vector <int> best[100005];
int sir[100005];
int main()
{
    ifstream cin("scmax.in");
    ofstream cout("scmax.out");
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
        cin>>v[i];
    best[1].push_back(v[1]);
    int cnt=1;
    for(int i=2;i<=n;i++)
    {
        if(cnt==1 && best[1].back()<v[i])
        {
            cnt++;
            best[cnt].push_back(v[i]);
        }
        else if(cnt==1 && best[1].back()>v[i])
            best[1].push_back(v[i]);
        else
        {
            if(v[i]>best[cnt].back())
            {
                cnt++;
                best[cnt].push_back(v[i]);
            }
            else
            {
                int st=1,dr=cnt;
                int retin=0;
                while(st<=dr)
                {
                    int mij=(st+dr)/2;
                    if(best[mij].back()<=v[i])
                    {
                        retin=mij;
                        st=mij+1;
                    }
                    else
                        dr=mij-1;
                }
                if(retin==0)
                    best[1].push_back(v[i]);
                else
                {
                    if(best[retin].back()!=v[i])
                    best[retin+1].push_back(v[i]);
                }
            }
        }
    }
    cout<<cnt<<'\n';
    int lastelem=best[cnt].back(),counter=0;
    sir[++counter]=lastelem;
    for(int i=cnt-1;i>=1;i--)
    {
        int retin=-1;
        for(auto x:best[i])
        {
            if(x<lastelem && retin<x)
                retin=x;
        }
        if(retin==-1)
            retin=best[i].back();
        sir[++counter]=retin;
        lastelem=retin;
    }
    for(int i=counter;i>=1;i--)
        cout<<sir[i]<<" ";
    return 0;
}