Cod sursa(job #1096885)

Utilizator gabrielvGabriel Vanca gabrielv Data 2 februarie 2014 18:13:20
Problema Subsir crescator maximal Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.01 kb
#include<cstdio>

using namespace std;

#define NMAX 100005
#define oo ((2<<32)-1)

int N,v[NMAX],best[NMAX],pred[NMAX];

void Read()
{
    freopen("scmax.in","r",stdin);
    scanf("%d",&N);
    for(int i=1;i<=N;i++)
        scanf("%d",&v[i]);
}

void TSFH()
{
    best[1]=1;
    v[N+1]=oo;
    int bmax;

    for(int i=1;i<=N+1;i++)
    {
        bmax=0;
        for(int j=1;j<i;j++)
            if(v[j]<v[i] && best[j]>best[bmax])
                bmax=j;

        if(bmax)
            {
                best[i]=best[bmax]+1;
                pred[i]=bmax;
            }
            else
                {
                    best[i]=1;
                    pred[i]=0;
                }
    }

}

void rec(int i)
{
    if(best[i])
    {
        rec(pred[i]);
        printf("%d ",v[i]);
    }
}

void Print()
{
    freopen("scmax.out","w",stdout);
    printf("%d\n",best[N+1]-1);
    rec(pred[N+1]);
}

int main()
{
    Read();
    TSFH();
    Print();
    return 0;
}