Pagini recente » Cod sursa (job #49573) | Cod sursa (job #341401) | Cod sursa (job #2868035) | Cod sursa (job #2854026) | Cod sursa (job #2530802)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
int n,m,aux,x;
int c[100005],rmq[20][100005];
int main()
{
in>>n>>m;
for(int i=1;i<=n;++i){
in>>rmq[0][i];
}
aux=n;
while(aux){
aux/=2;
x++;
}
for(int i=1;i<=x;++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 a,b,contor=0;;
for(int i=1;i<=m;++i){
in>>a>>b;
aux=a-b+1; x=1; contor=0;
while(x<aux){
x<<1;
contor++;
}
out<<min(rmq[contor][a],rmq[contor][b-x+1])<<'\n';
}
return 0;
}