Pagini recente » Cod sursa (job #2484978) | Cod sursa (job #3249319) | Cod sursa (job #329587) | Cod sursa (job #1677602) | Cod sursa (job #2226270)
#include <bits/stdc++.h>
#define LOG(x) for(k=0;(1<<k)<=(x);k++);--k;
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n, m, k, RMQ[17][100001];
int main()
{
f >> n >> m;
for(int i = 1; i <= n; i++)
f >> RMQ[0][i];
for(int i = 0; i < 16; i++)
for(int j = 1; j < n - i; j++)
RMQ[i + 1][j] = min(RMQ[i][j], RMQ[i][j + (1 << i)]);
while(m--)
{
int x, y;
f >> x >> y;
LOG(y - x + 1);
g << min(RMQ[k][x], RMQ[k][y + 1 - (1 << k)]) << "\n";
}
}