Pagini recente » Cod sursa (job #2574032) | Cod sursa (job #1692802) | Cod sursa (job #634860) | Cod sursa (job #907343) | Cod sursa (job #2764298)
#include <fstream>
#include <cmath>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
int n,i,j,d[10001][10001],m,x,y,l=1,nr,a=1,k;
int main()
{
cin>>n>>m;
for(i=1; i<=n; i++)
{
cin>>d[0][i];
}
while(l<n)
{
l*=2;
nr++;
}
nr--;
l/=2;
for(i=1; i<=nr; i++)
{
x=pow(2,i);
for(j=1; j<=n; j++)
{
d[i][j]=min(d[i-1][j],d[i-1][j+x-1]);
}
}
for(i=1; i<=m; i++)
{
cin>>x>>y;
a=1;
k=0;
while(a<=y-x)
{
a*=2;
k++;
}
a/=2;
k--;
a=pow(2,k);
cout<<min(d[k][x],d[k][y-a+1])<<'\n';
}
return 0;
}