Pagini recente » Cod sursa (job #1915966) | Cod sursa (job #1624039) | Cod sursa (job #1200288) | Cod sursa (job #1021570) | Cod sursa (job #3038075)
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int exponent[100001],n,m,a[21][100001],d,b;
int main()
{
exponent[1]=0;
for(int i=2;i<=n;i++)
{
exponent[i]=exponent[i/2]+1;
}
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];
if(i+(1<<(p-1))<=n && a[p][i]>a[p-1][i+(1<<(p-1))])
{
a[p][i]=a[p-1][i+(1<<(p-1))];
}
}
}
for(int j=1;j<=m;j++)
{
fin>>d>>b;
int x=b-d+1;
int y=exponent[x];
fout<<min(a[y][d], a[y][b-(1<<y)+1])<<"\n";
}
return 0;
}