Pagini recente » Cod sursa (job #297439) | Cod sursa (job #2845178) | Cod sursa (job #1387237) | Cod sursa (job #3149851) | Cod sursa (job #2417191)
#include <bits/stdc++.h>
#define DMAX 100010
#define LogDMAX 20
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int M[DMAX][LogDMAX];
int n,m,k;
inline int minim(int x,int y){
if(x<y)
return x;
return y;
}
int main(){
int i,j,x,y;
fin>>n>>m;
for(i=1;i<=n;i++)
fin>>M[i][0];
for(j=1;(1<<j)<=n;j++)
for(i=1;i+(1<<j)-1<=n;i++)
M[i][j]=minim(M[i][j-1],M[i+(1<<(j-1))][j-1]);
while(m--){
fin>>x>>y;
k=log2(y-x+1);
fout<<minim(M[x][k],M[y-(1<<k)+1][k])<<'\n';
}
return 0;
}