Pagini recente » Cod sursa (job #2183475) | Cod sursa (job #1212298) | Cod sursa (job #1910642) | Cod sursa (job #2222922) | Cod sursa (job #3248888)
#include <bits/stdc++.h>
#define NMAX 100002
using namespace std;
int N,M,r,x,y,st,dr,vmin,v[NMAX],sq[10002];
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;
}
};
InParser fin("rmq.in");
OutParser fout("rmq.out");
void citire()
{
fin>>N>>M;
r=235;
for(int i=1; i<=N; i++)
{
fin>>v[i];
sq[i/r]=INT_MAX;
}
}
void pre_calculare()
{
for(int i=1; i<=N; i++)
{
sq[i/r]=min(sq[i/r],v[i]);
}
}
int main()
{
citire();
pre_calculare();
for(int i=1; i<=M; i++)
{
fin>>x>>y;
st=x;
dr=y;
vmin=INT_MAX;
while(st<=dr && st%r)
{
vmin=min(vmin,v[st]);
st++;
}
while(st+r<=dr)
{
vmin=min(vmin,sq[st/r]);
st+=r;
}
while(st<=dr)
{
vmin=min(vmin,v[st]);
st++;
}
fout<< vmin << "\n";
}
return 0;
}