Cod sursa(job #1837841)

Utilizator jordan1998Jordan jordan1998 Data 30 decembrie 2016 15:11:34
Problema Subsir crescator maximal Scor 70
Compilator cpp Status done
Runda Arhiva educationala Marime 1.13 kb
#include <iostream>
#include <fstream>
#include <cstdio>
#define l 100001
using namespace std;
FILE*f=freopen("scmax.in","r",stdin);
ofstream g("scmax.out");
int a[l],b[l],c[l],n,m,i,j;
char buff[1048576];
int pos=0;
inline void read(int &nr)
{   int semn=1;
    while(buff[pos] < '0' || buff[pos] > '9') if(++pos == 1048576) fread(buff,  1,1048576, stdin), pos = 0;
    nr = 0;
    if(buff[pos-1]=='-') semn=-1;
    while('0' <= buff[pos] && buff[pos] <= '9')
    {
        nr = (nr<<1)+(nr<<3)+ buff[pos] - '0';
        if(++pos == 1048576) fread(buff, 1,1048576, stdin), pos = 0;
    }
    nr*=semn;
}
int main()
{
     read(n);
    for(i=1;i<=n;i++)read(a[i]);
    b[1]=1;
    for(i=2;i<=n;i++){
        m=0;
        for(j=1;j<i;j++)
            if(a[i]>a[j] and m<b[j])m=b[j];
        b[i]=m+1;
    }
    //am facut b
    //acum sol
    m=1;
    for(i=2;i<=n;i++)
        if(b[m]<b[i])m=i;
    c[b[m]]=a[m];
    j=b[m];n=b[m];
    g<<n<<'\n';
    while(b[m]>1){
        i=m-1;
        while(a[i]>a[m] or (b[i]!=b[m]-1)) i--;
        m=i;j--;c[j]=a[m];
    }
  for(i=1;i<=n;i++)
        g<<c[i]<<" ";
}