Pagini recente » Cod sursa (job #313736) | Cod sursa (job #400664) | Cod sursa (job #2448352) | Istoria paginii aplicatii-ale-cautarii-binare | Cod sursa (job #2176129)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n,m,x,y,l[100001],rmq[25][100001];
int main()
{
fin>>n>>m;
for (int i=1;i<=n;i++)
fin>>rmq[0][i];
for (int i=2;i<=n;i++)
l[i]=l[i/2]+1;
for (int i=1; (1<<i)<=n;i++)
for (int j=1;j+(1<<i)<=n+3;j++)
rmq[i][j]=min(rmq[i-1][j], rmq[i-1][j+(1<<(i-1))]);
for (;m;m--)
{
fin>>x>>y;
int l2=l[y-x+1];
fout<<min(rmq[l2][x], rmq[l2][y-(1<<l2)+1])<<'\n';
}
return 0;
}