Pagini recente » Cod sursa (job #1181674) | Cod sursa (job #91243) | Cod sursa (job #493003) | Cod sursa (job #2072448) | Cod sursa (job #2263969)
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int d[17][100001],i,j,x,y,k,m,n;
long long p;
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)
{
f>>d[0][i];
}
p=1;
for(i=1;i<=log2(n);i++)
{
for(j=1;j<=n-(1<<i)+1;j++)
{
d[i][j]=min(d[i-1][j],d[i-1][j+p]);
}
p=p*2;
}
for(i=1;i<=m;i++)
{
f>>x>>y;
if(x==y)
{
g<<d[0][x]<<'\n';
continue;
}
k=log2(y-x);
g<<min(d[k][x],d[k][y-(1<<k)+1])<<'\n';
}
return 0;
}