Pagini recente » Istoria paginii utilizator/costinelut | Monitorul de evaluare | Monitorul de evaluare | Monitorul de evaluare | Cod sursa (job #2547029)
#include <iostream>
#include <fstream>
#define NMAX 100005
#define NLOGMAX 18
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int M[NMAX][NLOGMAX],v[NMAX],log[NMAX];
int n,m;
int main() {
fin>>n>>m;
for(int i=1; i<=n; i++) {
fin>>v[i];
M[i][0]=v[i];
}
log[1]=0;
for(int i=2; i<=n; i++)
log[i]=log[i/2]+1;
for(int j=1; (1<<j)<=n; j++)
for(int i=1; i+(1<<j)-1<=n; i++) {
int k=1<<(j-1);
M[i][j]=min(M[i][j-1],M[i+k][j-1]);
}
for(int i=1; i<=m; i++) {
int x,y;
fin>>x>>y;
int k=log[y-x+1];
fout<<min(M[x][k],M[y-(1<<k)+1][k])<<endl;
}
return 0;
}