Cod sursa(job #1656558)

Utilizator badea_adi1999Badea Adrian Catalin badea_adi1999 Data 19 martie 2016 15:41:48
Problema Subsir crescator maximal Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.82 kb
#include <cstdio>
#include <algorithm>
#define nmax 100005
using namespace std;
int n,a[nmax],b[nmax];
int lmax,pre[nmax];

int binarys(int val)
{
    int sol=0;
    for (int i=1<<16;i;i>>=1)
        if (sol+i<=lmax&&val>a[b[sol+i]])
            sol+=i;
    return sol+1;
}
void solution(int m)
{
    if (!m)
        return;
    solution(pre[m]);
    printf("%d ",a[m]);
}
int main()
{
    freopen("scmax.in","r",stdin);
    freopen("scmax.out","w",stdout);
    int i,j,poz;
    scanf("%d",&n);
    for (i=1;i<=n;i++)
        scanf("%d",&a[i]);
    b[1]=1;lmax=1;
    for (i=2;i<=n;i++) {
        poz=binarys(a[i]);
        pre[i]=b[poz-1];
        if (poz>lmax||a[b[poz]]>a[i])
            b[poz]=i;
        lmax=max(lmax,poz);
    }
    printf("%d\n",lmax);
    solution(b[lmax]);
    return 0;
}