Pagini recente » Cod sursa (job #1316101) | Cod sursa (job #1653870) | Cod sursa (job #2432958) | Cod sursa (job #1004535) | Cod sursa (job #2291415)
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n,m,i,j,p,v[20][100001];
int l[100001];
int main(){
fin>>n>>m;
for(i=2;i<=n;i++)
l[i]=1+l[i/2];
for(i=1;i<=n;i++){
fin>>v[0][i];
}
for(i=1;i<=l[n]+1;i++){
for(j=1;j<=n;j++){
v[i][j]=v[i-1][j];
if(j+(1<<(i-1))<=n)
v[i][j]=min(v[i][j],v[i-1][j+(1<<(i-1))]);
}
}
for(;m;m--){
fin>>i>>j;
p=l[j-i+1];
fout<<min(v[p][i],v[p][j-(1<<p)+1])<<"\n";
}
return 0;
}