Pagini recente » Cod sursa (job #1247969) | Cod sursa (job #506676) | Cod sursa (job #1173189) | Cod sursa (job #952451) | Cod sursa (job #2976714)
#include <fstream>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
int rmq[100001][18];
int l2[1000001];
void query(int a, int b){
int k;
k = l2[b-a+1];
cout<<min(rmq[a][k], rmq[b-(1<<k)+1][k])<<'\n';
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
for(int i=2; i<=1000001; i++){
l2[i] = l2[i/2] + 1;
}
int n, q;
cin>>n>>q;
for(int i=0; i<n; i++){
int a;
cin>>a;
rmq[i][0] = a;
}
for(int j=1; (1<<j)<n; j++){
for(int i=0; i+(1<<j)<=n; i++)
rmq[i][j] = min(rmq[i][j-1], rmq[i + (1<<(j-1))][j-1]);
}
for(int i=0; i<q; i++){
int a, b;
cin>>a>>b;
query(a-1, b-1);
}
return 0;
}