Pagini recente » Cod sursa (job #1935503) | Cod sursa (job #3162451) | Cod sursa (job #7254) | Cod sursa (job #2624595) | Cod sursa (job #1649756)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
const int Nmax = 100005;
int X[Nmax], n, m, RMQ[20][Nmax], Log2[Nmax];
void Precalculate()
{
for(int i = 2; i <= n; i++) Log2[i] = Log2[i/2]+1;
for(int i = 1; i <= n; i++) RMQ[0][i] = X[i];
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))]);
}
}
}
int main()
{
f>>n>>m;
for(int i = 1; i <= n; i++) f>>X[i];
Precalculate();
while(m--)
{
int x,y;
f>>x>>y;
int k = y-x+1;
int l = Log2[k];
g<<min(RMQ[l][x], RMQ[l][y-(1<<l)+1])<<'\n';
}
return 0;
}