Pagini recente » Cod sursa (job #985094) | Cod sursa (job #2812890) | Cod sursa (job #731317) | Cod sursa (job #1499049) | Cod sursa (job #2546514)
#include <iostream>
#include <fstream>
#define NMAX 100000
#define NLOGMAX 18
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int M[NMAX][NLOGMAX],v[NMAX],n,m,log[NMAX];
void logaritm() {
int k=1;
for(int i=1;i<=n;i++) {
if(i>=(1<<k))
k++;
log[i]=k-1;
}
}
void rmq() {
for(int i=1;i<=n;i++)
M[i][0]=v[i];
for(int j=1; (1<<j)<=n; j++)
for(int i=1; i+(1<<j)-1<=n; i++)
M[i][j]=min(M[i][j-1],M[i+(1<<(j-1))][j-1]);
}
int main() {
fin>>n>>m;
for(int i=1; i<=n; i++)
fin>>v[i];
rmq();
logaritm();
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-k+1][k])<<endl;
}
return 0;
}