Pagini recente » Cod sursa (job #64449) | Cod sursa (job #258847) | Cod sursa (job #1588911) | Cod sursa (job #1116285) | Cod sursa (job #3216299)
#include <bits/stdc++.h>
#define pii pair<int, int>
#define ff first
#define ss second
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define eb emplace_back
#define int long long
using namespace std;
const string TASK("rmq");
ifstream fin(TASK + ".in");
ofstream fout(TASK + ".out");
#define cin fin
#define cout fout
const int N = 1e5 + 9, LG = 19;
int n, m, a[N];
int ST[N][LG];
void Precalc()
{
for(int i = 1; i <= n; ++i)ST[i][0] = a[i];
for(int k = 1; (1 << k) <= n; ++k)
for(int i = 1; i + (1 << k) - 1 <= n; ++i)
ST[i][k] = min(ST[i][k - 1], ST[i + (1 << (k - 1))][k - 1]);
}
int Query(int l, int r)
{
int k = log2(r - l + 1);
return min(ST[l][k], ST[r - (1 << k) + 1][k]);
}
signed main()
{
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n >> m;
for(int i = 1; i <= n; ++i)cin >> a[i];
Precalc();
int l, r;
for(int i = 1; i <= m; ++i)
{
cin >> l >> r;
cout << Query(l, r) << '\n';
}
return 0;
}