Pagini recente » Cod sursa (job #722251) | Cod sursa (job #3202808) | Cod sursa (job #2749595) | Cod sursa (job #390587) | Cod sursa (job #3216071)
#include <bits/stdc++.h>
#define eb emplace_back
#define ll long long
#define pii pair<int, int>
#define pli pair<ll, int>
#define pcc pair<char, char>
#define tpl tuple<int, int, int, int>
#define tli tuple<ll, int, int>
#define oo INT_MAX >> 1
using namespace std;
const string fn("rmq");
ifstream in(fn + ".in");
ofstream out(fn + ".out");
#define cin in
#define cout out
int rmq[18][100005], Log[100005];
int query(int l, int r)
{
int k = Log[r - l + 1];
return min(rmq[k][l + (1 << k) - 1], rmq[k][r]);
}
int main()
{
int n, q;
cin >> n >> q >> rmq[0][1];
Log[1] = 0;
for (int i = 2; i <= n; i++)
{
cin >> rmq[0][i];
Log[i] = Log[i / 2] + 1;
}
for (int i = 1; (1 << i) <= n; i++)
for (int j = (1 << i); j <= n; j++)
{
int k = (1 << (i - 1));
rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j - k]);
}
while (q--)
{
int l, r;
cin >> l >> r;
cout << query(l, r) << '\n';
}
return 0;
}