Pagini recente » Cod sursa (job #2012554) | Cod sursa (job #1271251) | Cod sursa (job #2308690) | Cod sursa (job #2674545) | Cod sursa (job #455547)
Cod sursa(job #455547)
/*
* File: main.cpp
* Author: virtualdemon
*
* Created on May 13, 2010, 9:32 PM
*/
#include <cstdlib>
#include <fstream>
#include <iterator>
#define Nmax 500011
/*
*
*/
using namespace std;
int H[Nmax];
inline void DownHeap( int k, int N )
{
for( int son=2*k; son <= N; k=son, son*=2 )
{
if( son < N && H[son] < H[son+1] )
++son;
if( H[k] >= H[son] )
return;
swap( H[k], H[son] );
}
}
inline void HeapSort( int left, int right )
{
for( int i=left+(right-left)/2; i >= left; --i )
DownHeap( i, right );
while( right >= left )
{
swap( H[left], H[right] );
--right;
DownHeap( left, right );
}
}
inline int medianof3( int left, int middle, int right )
{
if( left > middle )
{
if( middle > right )
return middle;
else return right;
}
if( middle > right )
{
if( right > left )
return right;
else return left;
}
return middle;
}
inline void IntroSort( int left, int right, int dlimit )
{
if( left < right )
{
if( !dlimit )
{
HeapSort( left, right );
return;
}
int lleft=left-1, rright=right+1, pValue=medianof3( H[left], H[left+(right-left)/2], H[right] );
for( ; ; )
{
while( lleft <= right && pValue > H[++lleft] );
while( rright >= 0 && pValue < H[--rright] );
if( lleft > rright )
break;
swap( H[lleft], H[rright] );
}
if( left < rright )
IntroSort( left, rright, dlimit-1 );
if( lleft < right )
IntroSort( lleft, right, dlimit-1 );
}
}
inline int Log2( int N )
{
int i, j=0;
for( i=1; i < N; i<<=1, ++j );
return j;
}
int main(int argc, char** argv)
{
int N;
ifstream in( "algsort.in" );
in>>N;
copy( istream_iterator<int>(in), istream_iterator<int>(), H+1 );
IntroSort( 1, N, 2*Log2(N) );
ofstream out( "algsort.out" );
copy( H+1, H+N+1, ostream_iterator<int>(out, " " ) );
out<<'\n';
return (EXIT_SUCCESS);
}