Pagini recente » Cod sursa (job #1997820) | Cod sursa (job #1411516) | Cod sursa (job #1913610) | Cod sursa (job #1426838) | Cod sursa (job #2179142)
#include<bits/stdc++.h>
#define NMAX 100005
#define DIM 500000
char buff[DIM];
int poz=0;
void read(int &nr) {
nr=0;
char semn='+';
while (buff[poz]<'0' || buff[poz]>'9') {
semn=buff[poz];
if (++poz==DIM) fread(buff,1,DIM,stdin),poz=0;
}
while ('0'<=buff[poz] && buff[poz]<='9') {
nr=nr*10+buff[poz]-'0';
if (++poz==DIM) fread(buff,1,DIM,stdin), poz=0;
}
if (semn=='-') nr=-nr;
}
using namespace std;
int rmq[NMAX][20];
int LOG[NMAX+5],n,m,a,b;
int main() {
freopen("rmq.in", "r", stdin);
freopen("rmq.out","w", stdout);
read(n); read(m);
for (int i=1; i<=n; i++) read(rmq[i][0]);
for (int i=2; i<=NMAX; i++) LOG[i]=LOG[i>>1]+1;
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--) {
read(a); read(b);
int l=b-a+1;
int k=LOG[l];
cout<<min(rmq[a][k], rmq[b-(1<<k)+1][k])<<'\n';
}
return 0;
}