Pagini recente » Cod sursa (job #506249) | Cod sursa (job #106297) | Cod sursa (job #2644344) | Cod sursa (job #345689) | Cod sursa (job #3254199)
#include <bits/stdc++.h>//DaryuF
#define ll long long
#define pb push_back
#define fi first
#define se second
#define pii pair <int,int>
#define MOD 777013
#define e exit(0)
using namespace std;
const string file = "rmq";
ifstream in(file + ".in");
ofstream out(file + ".out");
#define cin in
#define cout out
const int NMAX = 100001;
int n, q, rmq[NMAX][17], log_2[NMAX];
void build_rmq()
{
for(int i=2;i<=n;i++)
log_2[i] = log_2[i/2] + 1;
for(int j=1;(1<<j)<=n;j++)
for(int i=1; i + (1<<j) - 1<=n;i++)
rmq[i][j] = min(rmq[i][j-1],rmq[i+(1<<j-1)][j-1]);
}
int query(int x, int y)
{
if(x>y)
swap(x,y);
int l = y-x+1;
l = log_2[l];
return min(rmq[x][l],rmq[y-(1<<l)+1][l]);
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> q;
for(int i=1;i<=n;i++)
cin >> rmq[i][0];
build_rmq();
while(q--)
{
int x, y;
cin >> x >> y;
cout << query(x,y) << '\n';
}
return 0;
}