Pagini recente » Cod sursa (job #1711002) | Cod sursa (job #1030152) | Cod sursa (job #838928) | Cod sursa (job #3136421) | Cod sursa (job #2067342)
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int v[100002];
int a[100002][22];
int main()
{
int n,m;
fin>>n>>m;
for(int i=1;i<=n;i++)
{
fin>>v[i];
}
for(int i=1;i<=n;i++)
{
a[0][i]=v[i];
}
for(int i=1;(1<<i)<=n;i++)
{
for(int j=1;j<=n-(1<<i)+1;j++)
{
a[i][j]=min(a[i-1][j],a[i-1][j+(1<<(i -1))]);
}
}
int li,lj;
for(int i=1;i<=m;i++)
{
fin>>li>>lj;
int k=log(double(lj-li+1));
fout<<min(a[k][li],a[k][li+(lj-li+1-(1<<k))])<<"\n";
}
return 0;
}