Pagini recente » Monitorul de evaluare | Cod sursa (job #1436528) | Cod sursa (job #2973421) | Diferente pentru runda/acm_practice2 intre reviziile 3 si 4 | Cod sursa (job #2868732)
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(NULL),cin.tie(NULL),cout.tie(NULL);
#define pb push_back
#define mp make_pair
#define ll long long
#define ull unsigned long long
#define MAX 100000
#define FILES freopen("rmq.in","r",stdin);\
freopen("rmq.out","w",stdout);
#define mod 1000000007
using namespace std;
int n,q,v[MAX+5],rmq[MAX+5][18],st,dr;
int main()
{
fastio
FILES
cin >> n >> q;
for(int i = 1;i <= n; ++i)
cin >> v[i],rmq[i][0] = v[i];
int tot = n;
for(int i = 1;i <= log2(n); ++i)
{
tot -= (1 << (i - 1));
for(int j = 1;j <= tot; ++j)
rmq[j][i] = min(rmq[j][i-1],rmq[j+(1<<(i-1))][i-1]);
}
for(int i = 1;i <= q; ++i)
{
cin >> st >> dr;
int d = dr - st + 1, p = 1, e = 0;
while(p <= d) p *= 2, e++;
p >>= 1,e--;
cout << min(rmq[st][e],rmq[dr-p+1][e]) << '\n';
}
}