Pagini recente » Cod sursa (job #1392803) | Cod sursa (job #788929) | Cod sursa (job #2101811) | Cod sursa (job #1804230) | Cod sursa (job #1221486)
#include <fstream>
#define NMax 100005
#define LMax 20
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int N,M;
int X[NMax],Log2[NMax],RMQ[LMax][NMax];
int main()
{
for(int i=2;i<=N;i++)
Log2[i]=Log2[i/2]+1;
fin>>N>>M;
for(int i=1;i<=N;i++)
fin>>X[i];
for(int i=1;i<=N;i++)
RMQ[0][i]=X[i];
for(int i=1;(1<<i)<=N;i++)
for(int j=1;j<=N-(1<<i)+1;j++)
RMQ[i][j]=min(RMQ[i-1][j],RMQ[i-1][j+(1<<i)]);
while(M--)
{
int x,y;
fin>>x>>y;
if(x>y)
swap(x,y);
int diff=y-x+1;
int k=Log2[diff];
fout<<min(RMQ[k][x],RMQ[k][y-(1<<k)+1])<<"\n";
}
return 0;
}