Cod sursa(job #434918)

Utilizator alexandru92alexandru alexandru92 Data 6 aprilie 2010 18:42:53
Problema Subsir crescator maximal Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.31 kb
/* 
 * File:   main.cpp
 * Author: SpeeDemon
 *
 * Created on April 6, 2010, 6:21 PM
 */
#include <cstdlib>
#include <fstream>
#include <iterator>
#include <algorithm>
#define Nmax 100010

/*
 * 
 */
using namespace std;
int N;
int v[Nmax], v2[Nmax], ss[Nmax], aib[Nmax], father[Nmax];
inline void UpDate( int x, int y )
{
    for( int z=ss[y]; x <= N; x+=( x & -x ) )
        if( ss[aib[x]] < z )
            aib[x]=y;
}
inline int Query( int x )
{
    int mx;
    for( mx=0; x; x-=( x & -x ) )
        if( ss[aib[x]] > ss[mx] )
          mx=aib[x];
    return mx;
}
int main(int argc, char** argv)
{
    int i, idx=0, mx;
    int *start, *end;
    ifstream in( "scmax.in" );
    in>>N;
    for( i=1; i <= N; ++i )
    {
        in>>v[i];
        v2[i]=v[i];
    }
    start=v2+1; end=v2+N+1;
    sort( start, end );
    for( mx=i=1; i <= N; ++i )
    {
        if( v[i] != v[i-1] )
            idx=lower_bound( start, end, v[i] )-start+1;
        father[i]=Query( idx-1 );
        ss[i]=1+ss[father[i]];
        UpDate( idx, i );
        if( ss[i] > ss[mx] )
            mx=i;
    }
    i=idx=ss[mx];
    do
    {
        v2[idx]=v[mx], --idx;
        mx=father[mx];
    }while( mx );
    ofstream out( "scmax.out" );
    out<<i<<'\n';
    copy( v2+1, v2+i+1, ostream_iterator<int>( out, " " ) );
    out<<'\n';
    return (EXIT_SUCCESS);
}