Pagini recente » Cod sursa (job #2723689) | Cod sursa (job #1393282) | Cod sursa (job #2380452) | Cod sursa (job #154106) | Cod sursa (job #2171355)
#include <fstream>
#include <cmath>
#include <algorithm>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
#define nmax 100005
int rmq[18][nmax];
int n,m,logp[nmax];
void creare()
{
int i,j;
for(i=0;(1<<i)<=n;i++)
for(j=1;j+(1<<i)<=n;j++)
rmq[i+1][j]=min(rmq[i][j],rmq[i][j+(1<<i)]);
}
int main()
{
int i,x,y,dif,j;
f>>n>>m;
logp[0]=-1;
for(i=1;i<=n;i++)
{
f>>rmq[0][i];
logp[i]=logp[i/2]+1;
}
creare();
for(i=1;i<=m;i++)
{
f>>x>>y;
dif=logp[y-x];
//dif=log2(y-x);
g<<min(rmq[dif][x],rmq[dif][y-(1<<dif)+1])<<'\n';
}
return 0;
}