Pagini recente » Cod sursa (job #2126583) | Cod sursa (job #1850641) | Cod sursa (job #1705399) | Cod sursa (job #1730515) | Cod sursa (job #542000)
Cod sursa(job #542000)
#include <fstream>
#define nmax 100002
#define logN 17
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
inline int minim(int a,int b){if(a<b)return a;return b;}
int RMQ[logN][nmax];
int N,M,i,j,l,sh,dif;
int lg[nmax];
int V[nmax];
int main()
{
in>>N>>M;
for(i=1;i<=N;i++)in>>V[i];
for(i=2;i<=N;i++)lg[i]=lg[i/2]+1;
for(i=1;i<=N;i++)RMQ[0][i]=V[i];
for(i=1;(1<<i)<=N;i++)
{
for(j=1;j<=N-(1<<i)+1;j++)
{
l = 1<<(i-1);
RMQ[i][j] = minim(RMQ[i-1][j],RMQ[i-1][j+l]);
}
}
while(M--)
{
in>>i>>j;
dif=j-i+1;
l=lg[dif];
sh = dif-(1<<l);
out<<minim(RMQ[l][i],RMQ[l][i+sh])<<'\n';
}
return 0;
}