Pagini recente » Cod sursa (job #2667588) | Cod sursa (job #619133) | Cod sursa (job #2090583) | Cod sursa (job #1375355) | Cod sursa (job #2847307)
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
const int nmax=100000, nmax2=16, inf=(1<<30)-1;
int v[nmax2+1][nmax+1], lg[nmax+1];
int Min(int a, int b){
if(a<=b){
return a;
}else{
return b;
}
}
void test(int n){
for(int i=0;i<=lg[n];i++){
for(int j=1;j<=n-(1<<i)+1;j++){
fout<<v[i][j]<<" ";
}
fout<<"\n";
}
fout<<"\n";
}
int main(){
int n,m;
fin>>n>>m;
for(int i=2;i<=nmax;i++){
lg[i]=lg[i/2]+1;
}
for(int i=1;i<=n;i++){
fin>>v[0][i];
}
for(int i=1;i<=lg[n];i++){
for(int j=1;j<=n-(1<<i)+1;j++){
v[i][j]=Min(v[i-1][j],v[i-1][j+(1<<(i-1))]);
}
}
//test(n);
for(int i=1;i<=m;i++){
int x,y;
fin>>x>>y;
int log2=lg[y-x+1];
fout<<Min(v[log2][x],v[log2][1+y-(1<<log2)])<<"\n";
}
return 0;
}