Pagini recente » Cod sursa (job #2833141) | Cod sursa (job #2950378) | Cod sursa (job #2848655) | Cod sursa (job #935099) | Cod sursa (job #3161326)
#include <fstream>
#include <climits>
using namespace std;
ifstream fin ("rmq.in");
ofstream fout("rmq.out");
int r[17][100010];
int E[100010];
int n,m,i,st,dr,minim,e,p,len;
int main ()
{
fin>>n>>m;
for(i=1;i<=n;i++)
fin>>r[0][i];
for(p=1;(1<<p)<=n;p++)
for(i=1;i<=n;i++)
{
r[p][i]=r[p-1][i];
int j=i+(1<<(p-1));
if(j<=n && r[p][i]>r[p-1][j])
r[p][i]=r[p-1][j];
}
E[1]=0;
for(i=2;i<=n;i++)
E[i]=1+E[i/2];
for(i=1;i<=m;i++)
{
fin>>st>>dr;
e=E[dr-st+1];
len=(1<<e);
fout<<min(r[e][st], r[e][dr-len+1])<<'\n';
}
return 0;
}