Pagini recente » Cod sursa (job #2135316) | Cod sursa (job #1843221) | Cod sursa (job #467420) | Cod sursa (job #2130215) | Cod sursa (job #3241199)
#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;
poz=st+rand()%(dr-st+1);
swap(v[st],v[poz]);
pivot=v[st];
while(st<dr)
{
while(st<dr && v[dr]>=pivot)
{
dr--;
}
v[st]=v[dr];
while(st<dr && v[st]<=pivot)
{
st++;
}
v[dr]=v[st];
}
v[st]=pivot;
return st;
}
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;
}