Pagini recente » Cod sursa (job #848908) | Cod sursa (job #3142848) | Cod sursa (job #2299933) | Cod sursa (job #458245) | Cod sursa (job #3203526)
#include <bits/stdc++.h>
using namespace std;
#define int long long
int rmq[25][100005], lg[100005];
int32_t main(){
ifstream cin ("rmq.in");
ofstream cout ("rmq.out");
int n, m, l, r;
cin >> n >> m;
for(int i=1; i<=n; i++)
cin >> rmq[0][i];
lg[1]=0;
for(int i=2; i<=n; i++)
lg[i]=1+lg[i/2];
for(int i=1; i<=lg[n]; i++){
for(int j=1; j+(1<<i)-1<=n; j++)
rmq[i][j]=min(rmq[i-1][j], rmq[i-1][j+(1<<(i-1))]);
}
for(int i=1; i<=m; i++){
cin >> l >> r;
cout << min(rmq[lg[r-l+1]][l], rmq[lg[r-l+1]][r-(1<<(lg[r-l+1]))+1]);
cout << "\n";
}
return 0;
}