Pagini recente » Cod sursa (job #1524125) | Cod sursa (job #2900927) | Cod sursa (job #1058534) | Cod sursa (job #2941554) | Cod sursa (job #2754185)
#include <iostream>
#include <fstream>
using namespace std;
int rmq[100][100000], v[100000], log[100000];
ifstream f("rmq.in");
ofstream g("rmq.out");
int main(){
long n,m;
f>>n>>m;
for(int i=1; i<=n; i++){
f>>v[i];
}
for(int i=1; i<=n; i++){
rmq[0][i] = v[i];
}
for(int i=1; (1<<i)<=n; i++){
for(int j=1;j+(1<<i)-1<=n;j++){
rmq[i][j] = min(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);
}
}
for(int i=2; i<=n; i++){
log[i]=log[i/2]+1;
}
long long x,y,len,d,line;
for(int i=1; i<=m; i++){
f>>x>>y;
len=y-x+1;
line=log[len];
d=len-(1<<line);
g<<min(rmq[line][x],rmq[line][x+d])<<"\n";
}
}