Pagini recente » Cod sursa (job #1676087) | Cod sursa (job #1306944) | Cod sursa (job #934626) | Cod sursa (job #2769714) | Cod sursa (job #3211092)
#include <bits/stdc++.h>
using namespace std;
int v[100000][30];
int main()
{
ifstream cin("rmq.in");
ofstream cout("rmq.out");
int n,m,i,j,aux,b,a;
cin>>n>>m;
for(i=0;i<n;i++){
cin>>v[i][0];
}
for(j=1;(1<<j)<=n;j++)
for(i=0;i+(1<<j)-1<n;i++)
v[i][j]=min(v[i][j-1],v[i+(1<<(j-1))][j-1]);
//printf("a");
for(j=1;j<=m;j++){
cin>>a>>b;
aux=(int)log2(b-a+1);
cout<<min(v[a-1][aux],v[b-(1<<aux)][aux])<<"\n";
}
return 0;
}