Pagini recente » Cod sursa (job #234928) | Cod sursa (job #91271) | Cod sursa (job #1768258) | Cod sursa (job #1611372) | Cod sursa (job #1276653)
#include <fstream>
#include <iostream>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n,q,m[20][100001],st,dr,nr,lg[100001],a,i,l,j;
int main()
{
f>>n>>q;
for (i=1;i<=n;i++)
f>>a,m[0][i]=a;
for (i=1;(l=1<<i)<=n;i++)
for (j=1;j+l-1<=n;j++)
m[i][j]=min(m[i-1][j],m[i-1][j+(l>>1)]);
for (i=2;i<=n;i++)
lg[i]=lg[i/2]+1;
for (i=1;i<=q;i++)
{
f>>st>>dr;
nr=dr-st+1;
g<<min(m[lg[nr]][st],m[lg[nr]][st+nr-(1<<lg[nr])])<<'\n';
}
return 0;
}