Pagini recente » Cod sursa (job #2578564) | Cod sursa (job #1244277) | Cod sursa (job #2532418) | Cod sursa (job #1590992) | Cod sursa (job #2574829)
#include <iostream>
#include <fstream>
#include <cstring>
#include <vector>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n, m, v[100005], rmq[20][100005], lg[100005];
void citire() {
fin >> n >> m;
for(int i = 1; i <= n; i++)
fin >> v[i];
}
int RMQ(int a, int b) {
int logg = lg[b-a+1];
return min(rmq[logg][a], rmq[logg][b+1-(1<<logg)]);
}
void solve() {
for(int i = 2; i <= n; i++)
lg[i] = 1+lg[i/2];
for(int i = 1; i <= n; i++)
rmq[0][i] = v[i];
for(int i = 1; (1<<i) <= n; i++)
for(int j = 1; j +(1<<i) <= n+1; j++)
rmq[i][j] = min(rmq[i-1][j], rmq[i-1][j+(1<<(i-1))]);
while(m--) {
int x, y;
fin >> x >> y;
fout << RMQ(x, y) << '\n';
}
}
int main() {
citire();
solve();
}