Pagini recente » Cod sursa (job #834018) | Cod sursa (job #9140) | Cod sursa (job #1372439) | Cod sursa (job #153563) | Cod sursa (job #1594487)
#include <iostream>
#include <cmath>
#include <fstream>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int d[100100][16],i,j,k,a,b,m,p,n;
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)
f>>d[i][0];
p=(int)log2(n);
for(i=1;i<=n;i++)
for(j=1;i+(1<<j)<=n;j++)
d[i][j]=min(d[i][j-1],d[i+(1<<(j-1))][j-1]);
for(i=1;i<=m;i++)
{
f>>a>>b;
k=log2(b-a-1);
g<<min(d[a][k],d[b-(1<<k)+1][k])<<'\n';
}
}