Cod sursa(job #434783)

Utilizator alexandru92alexandru alexandru92 Data 6 aprilie 2010 15:56:47
Problema Subsir crescator maximal Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.1 kb
#include <cstdlib>
#include <fstream>
#include <iterator>
#include <algorithm>
#define Nmax 100001

/*
 *
 */
using namespace std;
int N;
int v[Nmax], v2[Nmax], ss[Nmax], aib[Nmax], idx[Nmax], father[Nmax];
inline void UpDate( int x, int y )
{
	for( ; x <= N; x+=( x & -x ) )
		if( ss[aib[x]] < ss[y] )
			aib[x]=y;
}
inline int Query( int x )
{
	int mx=0;
	for( ; x; x-=( x & -x ) )
		if( ss[aib[x]] > ss[mx] )
			mx=aib[x];
	return mx;
}
int main( void )
{
	int i, mx, l, ll;
	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( i=1; i <= N; ++i )
		idx[i]=lower_bound( start, end, v[i] )-start+1;
	for( mx=i=1; i <= N; ++i )
	{
		father[i]=Query( idx[i]-1 );
		ss[i]=1+ss[father[i]];
		UpDate( idx[i], i );
		if( ss[i] > ss[mx] )
			mx=i;
	}
	ll=l=ss[mx];
	do
	{
		v2[l]=v[mx]; --l;
		mx=father[mx];
	}while( mx );
	ofstream out( "scmax.out" );
	out<<ll<<'\n';
	copy( v2+1, v2+ll+1, ostream_iterator<int>( out, " " ) );
	return EXIT_SUCCESS;
}