Cod sursa(job #1888551)

Utilizator mihaihernestHernest Mihai mihaihernest Data 22 februarie 2017 10:44:35
Problema Subsir crescator maximal Scor 85
Compilator cpp Status done
Runda Arhiva educationala Marime 1.43 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,i,a[100005],b[100005],p,u,m,mj,q,k,c[100005],t,max1,r;
int main()
{
    f>>n;
    for(i=1;i<=n;i++)
        f>>a[i];
    b[1]=1;
    c[1]=a[1];
    m=1;
    max1=1;
    for(i=2;i<=n;i++)
    {
        if(a[i]>c[m])
        {
            b[i]=m+1;
            c[m+1]=a[i];
            m++;
        }
        else
            if(a[i]<c[1])
                {
                    b[i]=1;
                    c[1]=a[i];
                }
        else
        {
        p=1;
        u=m;
        while(p<=u)
        {
            k=(p+u)/2;
            if(a[i]>c[k]&&a[i]<=c[k+1])
            {
                t=k;
                break;
            }
            else
                if(a[i]<c[k])
                    u=k-1;
                else
                    p=k+1;
        }
        b[i]=t+1;
        c[t+1]=a[i];
        }
        if(b[i]>max1)
            {
                max1=b[i];
                r=i;
            }

    }
    g<<max1<<"\n";
    max1--;
    q=0;
    while(max1>0)
    {
            q++;
            c[q]=a[r];
        for(i=1;i<=r;i++)
            if(a[i]<a[r]&&b[i]==b[r]-1)
        {
            r=i;
            max1--;
            break;
        }
    }
    q++;
    c[q]=a[r];
    for(i=q;i>=1;i--)
        g<<c[i]<<" ";

    return 0;
}