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