Pagini recente » Cod sursa (job #1227617) | Cod sursa (job #3236392) | Cod sursa (job #2947288) | Cod sursa (job #2569504) | Cod sursa (job #3279866)
#include <bits/stdc++.h>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
int rmq[20][100005],lgn,lgm;
int main()
{
int n,m,a,b;
in>>n>>m;
lgn=log2(n);
for(int i=0;i<n;i++)
in>>rmq[0][i];
for(int i=1;i<=lgn;i++)
for(int j=0;j<n-(1<<i)+1;j++)
rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);
for(int i=1;i<=m;i++)
{
in>>a>>b;
a--;
b--;
if(a==b)
lgm=0;
else
lgm=log2(b-a);
out<<min(rmq[lgm][a],rmq[lgm][b-(1<<lgm)+1])<<"\n";
}
return 0;
}