Cod sursa(job #2675903)

Utilizator MenelausSontea Vladimir Menelaus Data 22 noiembrie 2020 20:06:14
Problema Subsir crescator maximal Scor 35
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.15 kb
#include <iostream>
#include <fstream>
#include <vector>

std::ifstream in("scmax.in");
std::ofstream out("scmax.out");

const int N=100001;
int v[N];

int cautare_binara(std::vector<int> v, int st, int dr, int elem)
{
    /// cauta cel mai mare i cu prop v[i]<elem

    if(st+1==dr)
    {
        return st;
    }

    int m=(st+dr)/2;
    if(v[m]<elem)
    {
        return cautare_binara(v, m, dr, elem);
    }
    else
    {
        return cautare_binara(v, st, m, elem);
    }
}

std::pair<int, int> scmax(int n)
{
    std::vector<int> lis(n+1, 0);
    int l=1, index=1;

    lis[1]=v[1];

    for(int i=2; i<=n; i++)
    {
        if(v[i]<lis[1])
        {
            lis[1]=v[i];
        }
        else
        {
            if(v[i]>lis[l])
            {
                lis[++l]=v[i];
                index=i;
            }
            else
            {
                lis[cautare_binara(lis, 0, l, v[i])+1]=v[i];
            }
        }
    }
    return {l, index};
}

int main()
{
    int n;

    in>>n;
    for(int i=1; i<=n; i++)
    {
        in>>v[i];
    }

    out<<scmax(n).first;
}