Pagini recente » Cod sursa (job #1391652) | Cod sursa (job #2780915) | Cod sursa (job #586637) | Cod sursa (job #183165) | Cod sursa (job #2445534)
#include <fstream>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
int q[20][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; (1<<i) <= n; i++)
for(int j = 1; j + (1 << i) - 1 <= n; j++)
q[i][j]=std::min(q[i-1][j], q[i-1][j + ( 1 << (i - 1))]);
}
void print()
{
int x, y;
while(m--)
cin >> x >> y, n = lg[y-x+1], cout << min(q[n][x], q[n][y + 1 - (1 << n)]) << '\n';
}
int main()
{
citire();
rez();
print();
}