Pagini recente » Cod sursa (job #912402) | Cod sursa (job #2582308) | Cod sursa (job #999682) | Cod sursa (job #2705469) | Cod sursa (job #2788094)
#include <bits/stdc++.h>
#define fastio std::ios_base::sync_with_stdio(NULL),cin.tie(NULL),cout.tie(NULL);
#define FILES freopen("rmq.in","r",stdin);\
freopen("rmq.out","w",stdout);
#define add emplace_back
#define mp make_pair
#define MAX 100000
#define TMAX 30
using namespace std;
int ans[MAX+5][TMAX+5],n,m,p2[TMAX+5],x,y;
int main()
{
fastio
FILES
cin >> n >> m;
for(int i = 0; i <= n; ++i)
{
for(int j = 0; j <= TMAX; ++j)
ans[i][j] = INT_MAX;
}
for(int i = 1; i <= n; ++i)
cin >> ans[i][0];
int exp = 0,x = 1;
while(x <= n)
p2[exp++] = x,x *= 2;
int t = n;
for(int i = 1; p2[i]; ++i)
{
t -= p2[i-1];
for(int j = 1; j <= t; ++j)
ans[j][i] = min(ans[j][i-1],ans[j+p2[i-1]][i-1]);
}
for(int i = 1; i <= m; ++i)
{
cin >> x >> y;
int lg = y - x + 1;
int e = 0,p = 1;
while(p * 2 <= lg) p *= 2,e++;
cout << min(ans[x][e],ans[y - e * 2 + 1][e]) << '\n';
}
}