Pagini recente » Cod sursa (job #741085) | Cod sursa (job #2772356) | Cod sursa (job #3190189) | Cod sursa (job #2091331) | Cod sursa (job #2445531)
#include <fstream>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
int q[25][100005], n, m, lg[100005];
void citire()
{
cin >> n >> m;
for(int i = 2 ; i <= n + 1 ; i++)
lg[i] = lg[i / 2] + 1, cin >> q[0][i - 1];
}
void rez()
{
for(int i = 1 ; (i << 1) <= n ; i++)
for(int j = 1 ; j + (i << 1) - 1 <= n ; j++)
q[i][j] = min(q[i-1][j], q[i-1][j + (1 << (i - 1))]);
}
void print()
{
int l, x, y;
for(int i = 1 ; i <= m ; i++)
cin >> x >> y, l = lg[y - x + 1], cout << min(q[l][x], q[l][y + 1 - (1 << l)]) << '\n';
}
int main()
{
citire();
rez();
print();
}