Pagini recente » Cod sursa (job #1648770) | Cod sursa (job #1673102) | Cod sursa (job #2819903) | Cod sursa (job #2957286) | Cod sursa (job #1910710)
#include <iostream>
#include <cmath>
#include <cstdio>
using namespace std;
int m,n,mCit[100002][18];
void citire()
{
scanf("%d%d",&m,&n);
for(int i=1;i<=m;i++)
{
scanf("%d",&mCit[i][0]);
}
int log=log2(m);
for(int i=1;i<=log;i++)
{
for(int j=1;j<=m;j++)
{
if(j+(1<<(i-1))>m)
mCit[j][i]=mCit[j][i-1];
else
mCit[j][i]=min(mCit[j][i-1],mCit[j+(1<<(i-1))][i-1]);
}
}
int st,dr,aux;
for(int i=1;i<=n;i++)
{
scanf("%d%d",&st,&dr);
aux=(int)(log2(dr-st+1));
printf("%d\n",min(mCit[st][aux],mCit[dr-aux][aux]));
}
}
int main()
{
freopen("rmq.in","r",stdin);
freopen("rmq.out","w",stdout);
citire();
/*for(int i=1;i<=m;i++)
{
for(int j=1;j<=log2(m);j++)
cout<<mCit[i][j]<<" ";
cout<<endl;
}
*/
return 0;
}