Pagini recente » Cod sursa (job #1525152) | Cod sursa (job #549487) | Cod sursa (job #437963) | Cod sursa (job #2302991) | Cod sursa (job #2754189)
#include <iostream>
#include <fstream>
using namespace std;
long n,m;
int rmq[100][100000], v[100000], log[100000];
ifstream f("rmq.in");
ofstream g("rmq.out");
void config(){
for(int i=2; i<=n; i++){
log[i]=log[i/2]+1;
}
}
long power2(int x){
return (1<<x);
}
int main(){
long long x,y,len,a,linie;
f>>n>>m;
for(int i=1; i<=n; i++){
f>>v[i];
rmq[0][i] = v[i];
}
for(int i=1; (1<<i)<=n; i++){
for(int j=1;j+(1<<i)-1<=n;j++){
if(rmq[i-1][j] < rmq[i-1][j+(1<<(i-1))]){
rmq[i][j] = rmq[i-1][j];
}else{
rmq[i][j] = rmq[i-1][j+(1<<(i-1))];
}
}
}
config();
for(int i=1; i<=m; i++){
f>>x>>y;
linie=log[y-x+1];
a=y-x+1-(1<<linie);
g<<min(rmq[linie][x],rmq[linie][x+a])<<"\n";
}
}