Pagini recente » Cod sursa (job #2131781) | Cod sursa (job #2207407) | Cod sursa (job #1406248) | Cod sursa (job #1752596) | Cod sursa (job #3241201)
#include <fstream>
#include <vector>
#include <cstdlib>
#include <ctime>
using namespace std;
int n,i,v[500009];
class InParser
{
vector<char> str;
int ptr;
ifstream fin;
char getChar()
{
if (ptr == int(str.size()))
{
fin.read(str.data(), str.size());
ptr = 0;
}
return str[ptr++];
}
template<class T>
T getInt()
{
char chr = getChar();
while (!isdigit(chr) && chr != '-')
chr = getChar();
int sgn = +1;
if (chr == '-')
{
sgn = -1;
chr = getChar();
}
T num = 0;
while (isdigit(chr))
{
num = num * 10 + chr - '0';
chr = getChar();
}
return sgn * num;
}
public:
InParser(const char* name) : str(1e5), ptr(str.size()), fin(name) { }
~InParser()
{
fin.close();
}
template<class T>
friend InParser& operator>>(InParser& in, T& num)
{
num = in.getInt<T>();
return in;
}
};
class OutParser
{
vector<char> str;
int ptr;
ofstream fout;
void putChar(char chr)
{
if (ptr == int(str.size()))
{
fout.write(str.data(), str.size());
ptr = 0;
}
str[ptr++] = chr;
}
template<class T>
void putInt(T num)
{
if (num < 0)
{
putChar('-');
num *= -1;
}
if (num > 9)
putInt(num / 10);
putChar(num % 10 + '0');
}
public:
OutParser(const char* name) : str(1e5), ptr(0), fout(name) { }
~OutParser()
{
fout.write(str.data(), ptr);
fout.close();
}
template<class T>
friend OutParser& operator<<(OutParser& out, const T num)
{
out.putInt(num);
return out;
}
friend OutParser& operator<<(OutParser& out, const char chr)
{
out.putChar(chr);
return out;
}
friend OutParser& operator<<(OutParser& out, const char* str)
{
for (int i = 0; str[i]; i++)
out.putChar(str[i]);
return out;
}
};
int Divide(int st, int dr)
{
int poz,pivot,i,j;
poz=st+rand()%(dr-st+1);
pivot=v[poz];
swap(v[poz],v[dr]);
i=st;
for(j=st; j<dr; j++)
{
if(v[j]<pivot)
{
swap(v[i],v[j]);
i++;
}
}
swap(v[i],v[dr]);
return i;
}
void Quick_Sort(int st, int dr)
{
int poz;
if(st<dr)
{
poz=Divide(st,dr);
Quick_Sort(st,poz-1);
Quick_Sort(poz+1,dr);
}
}
int main()
{
InParser fin("algsort.in");
OutParser fout("algsort.out");
srand(time(NULL));
fin>>n;
for(i=1; i<=n; i++)
{
fin>>v[i];
}
Quick_Sort(1,n);
for(i=1; i<=n; i++)
{
fout<< v[i] << " ";
}
return 0;
}