Pagini recente » Cod sursa (job #565092) | Cod sursa (job #421751) | Cod sursa (job #2224188) | Cod sursa (job #1919386) | Cod sursa (job #2682452)
#include <fstream>
#include <math.h>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n,m[100002][20],i,j,a[100005],lg[100005],q,x,y,p;
int main()
{
f>>n>>q;
for(i=1;i<=n;i++) f>>a[i];
lg[1]=0;
for(i=2;i<=n;i++) lg[i]=lg[i/2]+1;
for(i=1;i<=n;i++) m[i][0]=i;
for(j=1;(1<<j)<=n;j++)
for(i=1;i+(1<<j)-1<=n;i++)
{
if(a[m[i][j-1]]<a[m[i+(1<<(j-1))][j-1]])m[i][j]=m[i][j-1];
else m[i][j]=m[i+(1<<(j-1))][j-1];
}
for(i=1;i<=q;i++)
{
f>>x>>y;
p=(int)(log2(y-x+1));
g<<min(a[m[x][p]],a[m[y-(1<<p)+1][p]])<<'\n';
}
return 0;
}