Pagini recente » Cod sursa (job #2608766) | Cod sursa (job #1830977) | Cod sursa (job #2923549) | Cod sursa (job #1737272) | Cod sursa (job #434724)
Cod sursa(job #434724)
#include <vector>
#include <cstdlib>
#include <fstream>
#include <iterator>
/*
*
*/
using namespace std;
vector< int > v, TopMax, p;
int main( void )
{
int N, i, left, right, middle;
ifstream in( "scmax.in" );
in>>N;
p.resize( N );
copy( istream_iterator<int>( in ), istream_iterator<int>(), back_inserter(v) );
TopMax.push_back(0);
for( i=1; i < N; ++i )
{
if( v[i] > v[TopMax.back()] )
{
p[i]=TopMax.back();
TopMax.push_back(i);
continue;
}
left=0; right=TopMax.size()-1;
while( left < right )
{
middle=left+(right-left)/2;
if( v[i] >= v[TopMax[middle]] )
left=middle+1;
else right=middle;
}
if( v[TopMax[left]] > v[i] )
{
if( left > 1 )
p[i]=TopMax[left-1];
TopMax[left]=i;
}
}
for( N=TopMax.size(), i=TopMax.back(); N--; i=p[i] )
TopMax[N]=v[i];
ofstream out( "scmax.out" );
out<<TopMax.size()<<'\n';
copy( TopMax.begin(), TopMax.end(), ostream_iterator<int>( out, " " ) );
out<<'\n';
return EXIT_SUCCESS;
}