Pagini recente » Cod sursa (job #2883764) | Cod sursa (job #2449964) | Cod sursa (job #2276069) | Cod sursa (job #1575056) | Cod sursa (job #1245168)
#include <fstream>
using namespace std;
#define dim 100005
int rmq[dim][20];
inline int min(int a,int b){
return a > b ? b : a;
}
int main(){
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n,m;
fin >> n >> m;
for(int i = 1; i <= n; i++){
fin >> rmq[i][0];
}
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]);
}
}
while(m--){
int i,j,k;
fin >> i >> j;
for(k = 0; (1 << k) <= j - i + 1; k++);
k--;
fout << min(rmq[i][k],rmq[j-(1<<k)+1][k]) << "\n";
}
}