Pagini recente » Cod sursa (job #1976583) | Cod sursa (job #649133) | Cod sursa (job #708460) | Cod sursa (job #1068464) | Cod sursa (job #3038097)
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int exponent[100010],n,m,a[21][100010],d,b,aux;
int main()
{
fin>>n>>m;
for(int i=1;i<=n;i++)
{
fin>>a[0][i];
}
for(int p=1;(1<<p)<=n;p++)
{
for(int i=1;i<=n;i++)
{
a[p][i]=a[p-1][i];
aux=i+(1<<(p-1));
if(aux<=n && a[p][i]>a[p-1][aux])
{
a[p][i]=a[p-1][aux];
}
}
}
exponent[1]=0;
for(int i=2;i<=n;i++)
{
exponent[i]=exponent[i/2]+1;
}
for(int j=1;j<=m;j++)
{
fin>>d>>b;
int y=exponent[b-d+1];
int x=(1<<y);
fout<<min(a[y][d], a[y][b-x+1])<<"\n";
}
return 0;
}