Pagini recente » Borderou de evaluare (job #3332125) | Cod sursa (job #1722570) | Cod sursa (job #1500767) | Cod sursa (job #2027840) | Cod sursa (job #3310615)
#include <fstream>
#include <cmath>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
const int maxn=1000005;
int rmq[20][maxn];
int n,m;
int V[maxn];
int main()
{
cin>>n>>m;
for(int i=1;i<=n;i++){
cin>>V[i];
rmq[0][i]=V[i];
}
int log=log2(n)+1;
for(int i=1;i<=log;i++){
int p=pow(2,i-1);
for(int j=1;j<=n;j++){
rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+p]);
}
}
for(int i=1;i<=m;i++){
int st,dr;
cin>>st>>dr;
int x=dr-st+1;
int lg=log2(x);
int p=pow(2,lg);
cout<<min(rmq[lg][st],rmq[lg][dr-p+1])<<'\n';
}
return 0;
}