Pagini recente » Cod sursa (job #1266480) | Rating vasilescu matei (soldatuldeplatina) | Cod sursa (job #1095300) | Cod sursa (job #751622) | Cod sursa (job #2532603)
#include <fstream>
#include <cmath>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
int n,q,ind,p,x,y,lg,logy,mn[70][100100],answer;
long long P[70];
int main()
{
cin>>n>>q;
for(int i=1; i<=n; i++)
cin>>mn[0][i];
ind=1; p=2;P[1]=2;P[0]=1;
while(p<=n){
for(int i=1; i<=n-p+1; i++)
mn[ind][i]=min(mn[ind-1][i],mn[ind-1][i+p-1-(p/2)+1]);
P[++ind]=(p=p*2);
}
for(int i=1; i<=q; i++)
{
cin>> x>> y;
lg=y-x+1;
logy=log2(lg);
answer=min(mn[logy][x],mn[logy][y-P[logy]+1]);
cout<<answer<<'\n';
}
return 0;
}