Static Range Minimum Queries

1#include<bits/stdc++.h>
2using namespace std;
3#define int long long
4signed main(){
5  ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
6  int n,q; cin>>n>>q;
7  int st[n][__lg(n)+1];
8  for(int i=0;i<n;++i) cin>>st[i][0];
9  for(int j=1;(1<<j)<=n;++j) for(int i=0;i+(1<<j)<=n;++i)
10    st[i][j]=min(st[i][j-1],st[i+(1<<(j-1))][j-1]);
11  while(q--){
12    int a,b; cin>>a>>b; --a,--b;
13    int k=__lg(b-a+1);
14    cout<<min(st[a][k],st[b-(1<<k)+1][k])<<'\n';
15  }
16  return 0;
17}