Pagini recente » Cod sursa (job #1998709) | Cod sursa (job #498432) | Cod sursa (job #1056058) | Cod sursa (job #889121) | Cod sursa (job #2374225)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int N,M,a[20][100010],Lg[100010];
int main()
{
int i,j,x,y,dif;
for(i=2;i<=100000;i++)
{
Lg[i]=Lg[i/2]+1;
}
fin>>N>>M;
for(i=1;i<=N;i++)
{
fin>>a[0][i];
}
for(i=1;i<=Lg[N];i++)
{
for(j=1;j<=N+1-(1<<i);j++)
{
a[i][j]=min(a[i-1][j],a[i-1][j+(1<<(i-1))]);
}
}
for(i=1;i<=M;i++)
{
fin>>x>>y;
dif=y-x+1;
fout<<min(a[Lg[dif]][x],a[Lg[dif]][y-(1<<Lg[dif])+1])<<'\n';
}
}