Pagini recente » Cod sursa (job #1225135) | Cod sursa (job #117807) | Cod sursa (job #2676538) | Cod sursa (job #1722108) | Cod sursa (job #3242812)
#include <bits/stdc++.h>
#include <fstream>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int lg[100001],rmq[30][100001];
int build(int l){
int j;
for(j=1;j<=l;j++){
}
}
int main()
{
int i,n,q,j,l,r;
f >> n >> q;
lg[1]=0;
for(i=1;i<=n;i++){
f >> rmq[0][i];
if(i>=2){
lg[i]=lg[i/2]+1;
}
}
for(i=1;(1<<i)<=n;i++){
for(j=1;j<=n-(1<<i)+1;j++){
rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);
}
}
for(i=1;i<=q;i++){
f >> l >> r;
g << min(rmq[lg[r-l+1]][l],rmq[lg[r-l+1]][r-(1<<lg[r-l+1])+1]) << '\n';
}
return 0;
}