Pagini recente » Cod sursa (job #381441) | Cod sursa (job #157162) | Cod sursa (job #3196280) | Cod sursa (job #1778217) | Cod sursa (job #2106440)
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream in ("rmq.in");
ofstream out ("rmq.out");
int v[100001];
int mat[100000][17];
int main() {
int n,m;
int i,j;
in>>n>>m;
for(i=1; i<=n; i++)
in>>v[i];
int st,dr;
int x;
for(i=1; i<=n; i++)
mat[i][0]=v[i];
for(j=1; (1<<j)<=n; j++) {
for(i=1; i+(1<<j)-1 <= n; i++) {
if(mat[i][j-1] < mat[i+(1<<(j-1))][j-1])
mat[i][j] = mat[i][j-1];
else
mat[i][j] = mat[i+(1<<(j-1))][j-1];
}
}
for(i=1; i<=m; i++) {
in>>st>>dr;
x=log2(dr-st+1);
if(mat[st][x] < mat[dr-(1<<x)+1][x])
out<<mat[i][x];
else
out<<mat[dr-(1<<x)+1][x];
out<<'\n';
}
return 0;
}