Pagini recente » Cod sursa (job #323573) | Cod sursa (job #3177497) | Cod sursa (job #2541562) | Cod sursa (job #1725622) | Cod sursa (job #2984407)
#include <fstream>
#include <math.h>
using namespace std;
ifstream f("rmq.in");
ofstream foo("rmq.out");
int n,m,d[100002][20],i,j,x,y,p;
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]);
for(i=1;i<=m;i++)
{
f>>x>>y;
p=log2(y-x+1);
foo<<min(d[x][p],d[y-(1<<p)+1][p])<<'\n';
}
return 0;
}