Pagini recente » Cod sursa (job #589053) | Cod sursa (job #1519023) | Cod sursa (job #1889823) | Cod sursa (job #941088) | Cod sursa (job #2864884)
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n,m,a[21][100000];
int main()
{
int i,j,x,y;
f>>n>>m;
for(i=1;i<=n;i++)
f>>a[0][i];
for(i=1;(1<<i)<=n;i++)
for(j=1;j<=n-(1<<i)+1;j++)
a[i][j]=min(a[i-1][j],a[i-1][j+(1<<(i-1))]);
for(i=1;i<=m;i++)
{
f>>x>>y;
int lungime=y-x+1;
lungime=log2(lungime);
g<<min(a[lungime][x],a[lungime][y-(1<<lungime)+1])<<'\n';
}
return 0;
}