Pagini recente » Cod sursa (job #2347780) | Cod sursa (job #2068082) | Cod sursa (job #1279520) | Cod sursa (job #1885956) | Cod sursa (job #3041898)
#include <bits/stdc++.h>
#define LG 100000
using namespace std;
ifstream fin ("rmq.in");
ofstream fout ("rmq.out");
int N, M, v[LG + 5], rmq[LG+ 5][30];
int main()
{
fin >> N >> M;
for (int i = 1; i <= N; i++){
fin >> v[i];
rmq[i][0] = v[i];
}
for (int j = 1; (1 << j) <= N; j++){
for (int i = 1; i + (1 << j) - 1 <= N; i++){
rmq[i][j] = min(rmq[i][j - 1], rmq[i + (1 << j) - 1][j - 1]);
}
}
for (int i = 1; i <= M; i++){
int x, y;
fin >> x >> y;
int k = log2(y - x + 1);
fout << min(rmq[x][k], rmq[y - (1 << k) + 1][k]) << '\n';
}
return 0;
}