Pagini recente » Cod sursa (job #787797) | Cod sursa (job #2030221) | Cod sursa (job #2872077) | Cod sursa (job #2785214) | Cod sursa (job #2834500)
#include <fstream>
using namespace std;
ifstream fin ("rmq.in");
ofstream fout("rmq.out");
int n,m,i,j,st,dr,minim,p,e,len,x[100010],v[17][100010];
int main ()
{
fin>>n>>m;
for (i=1; i<=n; i++)
fin>>v[0][i];
for (p=1; (1<<p)<=n; p++)
{
for (i=1; i<=n; i++)
{
v[p][i]=v[p-1][i];
j=i+(1<<(p-1));
if (j<=n&&v[p][i]>v[p-1][j])
v[p][i]=v[p-1][j];
}
}
x[1]=0;
for (i=2; i<=n; i++)
x[i]=1+x[i/2];
for (i=1; i<=m; i++)
{
fin>>st>>dr;
e=x[dr-st+1];
len=(1<<e);
fout<<min(v[e][st],v[e][dr-len+1])<<"\n";
}
}