Pagini recente » Cod sursa (job #1115755) | Cod sursa (job #1032629) | Cod sursa (job #3270599) | Cod sursa (job #1184285) | Cod sursa (job #3247095)
#include <fstream>
#include <cmath>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
#define ll long long
ll n, m;
ll rmq[100001][20];
ll v[100001];
int i;
int main()
{
cin>>n>>m;
for(i = 1; i <= n; i++)
cin>>v[i];
for(int i = 1; i <= n; i++)
{
int p1, p2;
rmq[i][0] = v[i];
for(p1 = 1, p2 = 1; p2 <= i; p1++)
rmq[i][p1] = min(rmq[i][p1 - 1], rmq[i - p2][p1 - 1]), p2<<=1;
}
ll x, y, l, p;
for(i = 1; i <= m; i++)
{
cin>>x>>y;
l = (y - x + 1);
p = log2(l);
cout<<min(rmq[y][p], rmq[x + (1<<p) - 1][p])<<'\n';
}
return 0;
}