Pagini recente » Cod sursa (job #633643) | Cod sursa (job #1685484) | Cod sursa (job #3291483) | Cod sursa (job #231944) | Cod sursa (job #1082933)
#include <fstream>
using namespace std;
int n,m,rmq[18][100001],lg[100001];
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int main()
{
int i,j,l;
fin>>n>>m;
for(i=2;i<=n;i++)
lg[i]=lg[i>>1]+1;
for(i=1;i<=n;i++)
fin>>rmq[0][i];
for(i=1;(1<<i)<=n;i++)
for(j=1;j<=n-(1<<i)+1;j++)
rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);
while(m--)
{
fin>>i>>j;
l=lg[j-i+1];
fout<<min(rmq[l][i],rmq[l][j-(1<<l)+1])<<"\n";
}
return 0;
}