Pagini recente » Cod sursa (job #1310042) | Cod sursa (job #2118881) | Cod sursa (job #3211782) | Borderou de evaluare (job #2478312) | Cod sursa (job #3159855)
#include <fstream>
#define DIM 100001
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int E[DIM];
int r[18][DIM];
int n, m;
void build() {
for (int power = 1; (1 << power) <= n; power++) {
for (int i = 1; i <= n; i++) {
r[power][i] = r[power - 1][i];
int j = i + (1 << (power - 1));
if (j <= n)
r[power][i] = min(r[power][i], r[power - 1][j]);
}
}
}
void buildPowerArray() {
E[1] = 0;
for (int i = 2; i <= n; i++) {
E[i] = 1 + E[i / 2];
}
}
int query(int st, int dr) {
int len = dr - st + 1;
int power = E[len];
return min(r[power][st], r[power][dr - (1 << power) + 1]);
}
int main()
{
fin >> n >> m;
for (int i = 1; i <= n; i++) {
fin >> r[0][i];
}
build();
buildPowerArray();
int a, b;
for (int i = 1; i <= m; i++) {
fin >> a >> b;
fout << query(a, b) << "\n";
}
}