Pagini recente » Cod sursa (job #2861474) | Cod sursa (job #2837609) | Cod sursa (job #3164117) | Cod sursa (job #2964296) | Cod sursa (job #3170924)
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
const int NMax = 100000;
int RMQ[20][NMax + 5],Log2[NMax + 5];
int N,M;
void Read()
{
fin >> N >> M;
for(int i = 1; i <= N; ++i)
fin >> RMQ[0][i];
}
void Precalculate()
{
for(int i = 2; i <= N; ++i)
Log2[i] = Log2[i/2] + 1;
for(int i = 1; (1<<i) <= N; ++i)
for(int j = 1; j <= N - (1<<i) + 1 ; ++j)
RMQ[i][j] = min(RMQ[i-1][j],RMQ[i-1][j+(1<<(i-1))]);
}
void SolveandPrint()
{
while(M--)
{
int x,y;
fin >> x >> y;
int k = Log2[y-x+1];
fout << min(RMQ[k][x],RMQ[k][y-(1<<k)+1])<<"\n";
}
}
int main()
{
Read();
Precalculate();
SolveandPrint();
return 0;
}