Pagini recente » Cod sursa (job #2901750) | Cod sursa (job #2907106) | Cod sursa (job #960956) | Cod sursa (job #178379) | Cod sursa (job #595858)
Cod sursa(job #595858)
#include <fstream>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
const int N=100002;
const int M=18;
int a[M][N],lg[N];
int min(int x, int y){
if(x<y)
return x;
return y;
}
int main(){
int i,j,x,y,dif,l,n,m;
in>>n>>m;
for(i=1;i<=n;i++){
in>>a[0][i];
}
lg[1]=0;
for(i=1;i<=n;i++){
lg[i]=lg[i/2]+1;
}
for(i=1;(1<<i)<=n;i++){
for(j=1;j<=n-(1<<i);j++){
a[i][j]=min(a[i-1][j],a[i-1][j+(1<<i-1)]);
}
}
for(i=1;i<=m;i++){
in>>x>>y;
dif=x-y+1;
l=lg[dif];
out<<min(a[l][x],a[l][y+1-(1<<l)])<<"\n";
}
return 0;
}