Pagini recente » Cod sursa (job #2018586) | Monitorul de evaluare | Cod sursa (job #1162724) | Borderou de evaluare (job #1510250) | Cod sursa (job #1382955)
#include <bits/stdc++.h>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
int rmq[20][100010];//rmq[logN][N]
int n,m,lg[100010],t;
int main()
{
//citire
in>>n>>m;
for(int i=1;i<=n;i++)in>>rmq[0][i];
//rmq
for(int i=2;i<=n;i++)lg[i]=lg[i/2]+1;//logaritmi
for(int i=1;(1<<i)<=n;i++)
for(int j=1;j+(1<<i)-1<=n;j++)
rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);
//queries
for(;m;m--)
{
int x,y;
in>>x>>y;
int dif=lg[y-x+1];
out<<min(rmq[dif][x],rmq[dif][y+1-(1<<dif)])<<'\n';
}
return 0;
}