Pagini recente » Cod sursa (job #2528377) | Cod sursa (job #2983504) | Cod sursa (job #1992990) | Cod sursa (job #744245) | Cod sursa (job #2572455)
#include <bits/stdc++.h>
#define pb push_back
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
void debug_out() { cerr << '\n'; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << " " << H; debug_out(T...);}
#define dbg(...) cerr << #__VA_ARGS__ << " ->", debug_out(__VA_ARGS__)
#define dbg_v(x, n) do{cerr<<#x"[]: ";for(int _=0;_<n;++_)cerr<<x[_]<<" ";cerr<<'\n';}while(0)
#define dbg_ok cerr<<"OK!\n"
typedef pair<int,int> pii;
typedef long long int ll;
typedef long double ld;
const int DMAX = 1e5+10;
const int LogMAX = 25;
int dp[DMAX][LogMAX];
int n,m,k;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int t,i,j;
int x,y;
fin>>n>>m;
for(i=1;i<=n;i++)
fin>>dp[i][0];
for(j=1;(1<<j) <= n;j++)
for(i=1;i+(1<<j)-1 <= n;i++)
dp[i][j]=min(dp[i][j-1],dp[i+(1<<(j-1))][j-1]);
while(m--){
fin>>x>>y;
if(x > y)
swap(x,y);
k=log2(y-x+1);
fout<<min(dp[x][k],dp[y-(1<<k)+1][k])<<'\n';
}
return 0;
}