Pagini recente » 6pb | Cod sursa (job #1815920) | Cod sursa (job #2186284) | Cod sursa (job #1699176) | Cod sursa (job #2457138)
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n,m,i,j,p,v[100005],a[100005][20],k,x,y;
int log(int x){
int k=0;
while((1<<(k+1))<=x)
k++;
return k;
}
int main(){
fin>>n>>m;
for(i=1;i<=n;i++){
fin>>v[i];
a[i][0]=i;
}
k=sqrt(n);
for(j=1;j<=k;j++)
for(i=1;i+(1<<j)-1<=n;i++)
if(v[a[i][j-1]]<v[a[i+(1<<(j-1))][j-1]])
a[i][j]=a[i][j-1];
else
a[i][j]=a[i+(1<<(j-1))][j-1];
for(i=1;i<=m;i++){
fin>>x>>y;
p=log(y-x+1);
if((1<<p)==y-x+1)
fout<<v[a[x][p]]<<'\n';
else
fout<<min(v[a[x][p]],v[y])<<'\n';
}
return 0;
}