Pagini recente » Cod sursa (job #2747014) | Cod sursa (job #1898401) | Cod sursa (job #1214836) | Cod sursa (job #1668115) | Cod sursa (job #2264838)
#include <fstream>
#include <cmath>
using namespace std;
int d[35][100001],n,m,i,j,x,y,k,a[32];
ifstream f("rmq.in");
ofstream g("rmq.out");
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)
f>>d[0][i];
for(i=1;i<=17;i++)
for(j=1;j<=n-(1<<i)+1;j++)
{
if(j+(1<<(i-1)))
d[i][j]=min(d[i-1][j],d[i-1][j+(1<<(i-1))]);
}
for(i=1;i<=m;i++)
{
f>>x>>y;
for(j=0;j<=30;j++)
if((1<<j)>y-x){j--;break;}
k=j;
g<<min(d[k][x],d[k][y-(1<<(k))+1])<<"\n";
}
return 0;
}