Pagini recente » Cod sursa (job #777495) | Cod sursa (job #2305477) | Cod sursa (job #63279) | Cod sursa (job #1198015) | Cod sursa (job #2654387)
#include <bits/stdc++.h>
using namespace std;
int r[100001][17], v[100001], n, m, i, j, a, b, rez, l;
int main()
{
ifstream cin("rmq.in");
ofstream cout("rmq.out");
cin >> n >> m;
v[1] = 0;
for(i = 2; i <= n; i++)
v[i] = 1 + v[i/2];
for(i = 1; i <= n; i++)
{
cin >> r[i][0];
for(j = 1; (1<<j) <= i; j++)
r[i][j] = min(r[i-(1<<(j-1))][j-1], r[i][j-1]);
}
for(i = 1; i <= m; i++)
{
cin >> a >> b;
l = v[b-a+1];
rez = min(r[a+(1<<l)-1][l], r[b][l]);
cout << rez << '\n';
}
return 0;
}