Cod sursa(job #744682)

Utilizator test0Victor test0 Data 9 mai 2012 13:42:27
Problema Subsir crescator maximal Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.75 kb
#include <cstdio>
#define MAX 100010
#include <algorithm>
using namespace std;
int n,V[MAX],C[MAX],nr;

int cbinar(int x){
    int l=1,r=nr+1,md;
    while(l<r){
        md=(l+r)/2;
        if(V[md]>=x)r=md; else l=md+1;
    }
    if(r>nr)nr=r;
    return r;
}

void tipar(int pos,int nr){
    for(int i=pos;i>=0;i--)
    if(C[i]==nr){
        tipar(i,nr-1);
        printf("%d ",V[i]);
        return; }
}

int main(){
    freopen("scmax.in","r",stdin);
    freopen("scmax.out","w",stdout);
        scanf("%d",&n);
        for(int i=0;i<n;i++)scanf("%d",&V[i]);
        for(int i=0;i<n;i++)C[i]=cbinar(V[i]);
       // for(int i=0;i<n;i++)printf("%d ",C[i]);
    nr=0;
    for(int i=0;i<n;i++)nr=max(nr,C[i]);
    printf("%d\n",nr);
    tipar(n,nr);
}

// o sortare