Pagini recente » Istoria paginii utilizator/iancumarian96 | Cod sursa (job #993928) | Cod sursa (job #1204476) | Statistici Chelariu Rares M. (rareschelariu790) | Cod sursa (job #1454066)
#include <iostream>
#include <fstream>
using namespace std;
int i,j,log[100005],rmq[18][100005],p,n,m;
int main()
{
ifstream cin("rmq.in");
ofstream cout("rmq.out");
cin>>n>>m;
log[1]=0;
for (i=1; i<=n; ++i) {
log[i+1]=log[(i+1)/2]+1;
cin>>rmq[0][i];
}
//build rmq
for (i=1, p=1; i<=log[n]; ++i, p*=2)
for (j=1; j+p*2-1<=n; ++j)
rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+p]);
int x,y;
for (i=1; i<=m; ++i){
cin>>x>>y;
int dist=log[y-x+1];
cout<<min(rmq[dist][x],rmq[dist][y-(1<<dist)+1])<<"\n";
}
return 0;
}