Pagini recente » Cod sursa (job #1615504) | Cod sursa (job #1842553) | Cod sursa (job #258169) | Cod sursa (job #2322598) | Cod sursa (job #3159841)
#include <iostream>
#include <fstream>
using namespace std;
//ifstream f("in.in");
//ofstream g("out.out");
ifstream f("rmq.in");
ofstream g("rmq.out");
int n,m,v[50][100005];
int x,y;
int E[100005];
int main()
{
f>>n>>m;
for(int i=1;i<=n;i++){
f>>v[0][i];
}
for(int e=1;(1<<e)<=n;e++){
for(int i=1;i<=n;i++){
v[e][i] = v[e-1][i];
if(i+(1<<(e-1)) <= n){
v[e][i] = min(v[e][i],v[e-1][i+(1<<(e-1))]);
}
}
}
E[1] = 0;
for(int i=2;i<=n;i++){
E[i] = E[i/2]+1;
}
for(int i=1;i<=m;i++){
f>>x>>y;
int e = E[(y-x)];
int len = (1<<e);
//cout<<x<<" "<<y<<" "<<len<<'\n';
g<<min(v[e][x],v[e][y-len+1])<<'\n';
}
return 0;
}