Pagini recente » Cod sursa (job #494549) | Istoria paginii runda/proba_pregatire_ioit/clasament | Cod sursa (job #2686875) | Istoria paginii runda/lucian_blaga_cls_10 | Cod sursa (job #2906876)
#include <fstream>
#include <math.h>
#define NMAX 100005
using namespace std;
ifstream f ("rmq.in");
ofstream g ("rmq.out");
long int n, m, mat[NMAX][int(log2(NMAX))+1], x, y;
int main(){
f >> n >> m;
for(int i = 1 ; i <= n; i++) {
f >> mat[i][0];
}
for(int j = 1; j <= log2(n) ; j++)
for(int i = 1; i <= n - (1 << j) + 1; i++)
mat[i][j] = min(mat[i][j-1], mat[i + (1 << (j-1))][j-1]);
for(int i = 1; i <= m; i++) {
f >> x >> y;
int l = log2(y - x + 1);
g << min(mat[x][l], mat[ y - (1 << l) +1][l]) << '\n';
}
return 0;
}