Pagini recente » Cod sursa (job #2111734) | Cod sursa (job #433583) | Cod sursa (job #563981) | Cod sursa (job #2050904) | Cod sursa (job #2440027)
#include<bits/stdc++.h>
using namespace std;
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define sz size()
#define x first
#define y second
#define pi pair <int, int>
#define pii pair <int, pi>
#define vi vector <int>
const ll mod = 1e9 + 7;
int n, a[100001], mn[100001][26], q;
int32_t main(){
ios_base :: sync_with_stdio(0); cin.tie(); cout.tie();
ifstream cin("rmq.in");
ofstream cout("rmq.out");
cin>>n>>q;
for(int i=1; i<=n; i++){
cin>>a[i];
}
for(int i=1; i<=n; i++) mn[i][0]=a[i];
for(int j=1; (1<<j)<=n; j++){
for(int i=1; i+(1<<j)<=n+1; i++){
mn[i][j]=min(mn[i][j-1], mn[i+(1<<(j-1))][j-1]);
}
}
//for(int i=1; i<=n-(1<<2)+1; i++) cout<<mn[i][2]<<" ";
while(q--){
int l, r;
cin>>l>>r;
int lg=log2(l-r+1);
lg++;
cout<<min(mn[l][lg], mn[r-(1<<lg)+1][lg])<<"\n";
}
}