Pagini recente » Cod sursa (job #784049) | Cod sursa (job #1007962) | Cod sursa (job #2122646) | Cod sursa (job #1235209) | Cod sursa (job #2611515)
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("rmq.in");
ofstream fout ("rmq.out");
int mt[20][100005];
int lg[100005];
int N, M;
int main ()
{
fin >> N >> M;
for (int i = 1; i <= N; i++)
fin >> mt[1][i];
for(int i = 2; i <= N; i++)
lg[i] = lg[i / 2] + 1;
for (int j = 1; j <= lg[N]; j++)
for (int i = 1; i + j <= N; i++)
mt[j + 1][i] = min (mt[j][i], mt[j][i + j]);
for (int i = 1; i <= M; i++)
{
int a, b;
fin >> a >> b;
int val = lg[b - a];
fout << min (mt[val + 1][a], mt[val + 1][b - (1 << val) + 1]) << "\n";
}
}