Pagini recente » Cod sursa (job #1780812) | Cod sursa (job #2053990) | Cod sursa (job #828117) | Cod sursa (job #2001177) | Cod sursa (job #2392479)
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n,m,d[100001][22],i,j,x,q,a,b;
int main()
{
f>>n>>m;
for(i=1; i<=n; i++)
{
f>>d[i][0];
}
for (j=1; (1<<j)<=n; j++)
{
for (i=1; i+(1<<j)-1<=n; i++)
{
d[i][j]=min(d[i][j-1],d[i+(1<<(j-1))][j-1]);
}
}
//g<<d[1][2]<<" ";
for(q=1; q<=m; q++)
{
f>>a>>b;
x=log2(b-a+1);
g<<min(d[a][x],d[b-(1<<x)+1][x])<<'\n';
}
return 0;
}