Pagini recente » Cod sursa (job #2106398) | Cod sursa (job #837741) | Cod sursa (job #192438) | Cod sursa (job #534947) | Cod sursa (job #2706859)
#include <bits/stdc++.h>
//#pragma GCC optimize("O3")
#define test " test "
#define ll long long
#define pii pair<int, int>
#define FASTIO \
cin.tie(0); \
cout.tie(0); \
ios_base::sync_with_stdio(0);
#define FILES \
freopen("rmq.in", "r", stdin); \
freopen("rmq.out", "w", stdout);
#define testcase \
int T; \
cin >> T; \
while (T--)
#define vec vector<int>
using namespace std;
int r[100002][100];
signed main()
{
FASTIO;
int n, m;
cin >> n >> m;
vec v(n + 1);
for(int i = 1; i <= n; i++)
cin >> v[i];
for(int i = 1; i <= n; i++)
r[i][0] = v[i];
int lo = log2(n);
for(int i = 1; i <= lo; i++)
for(int j = 1; j + (1 << i) - 1 <= n; j++)
r[j][i] = min(r[j][i - 1], r[j + (1 << (i - 1))][i - 1]);
while(m--)
{
int x, y;
cin >> x >> y;
int le = log2(y - x + 1);
cout << min(r[x][le], r[y - (1 << le - 1)][le]) << '\n';
}
return 0;
}