Pagini recente » Cod sursa (job #1204293) | Cod sursa (job #861727) | Cod sursa (job #2660935) | Cod sursa (job #1939166) | Cod sursa (job #1526020)
#include <bits/stdc++.h>
using namespace std;
#define MAX 100008
ifstream in("rmq.in");
ofstream out("rmq.out");
int v[MAX],lg[MAX],rmq[18][MAX],n;
void RMQ()
{ int i,j;
for(i=2;i<=n;i++)
lg[i]=lg[i/2]+1;
for(i=1;i<=lg[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))]);
}
int getmin(int a, int b)
{ int el=lg[b-a+1];
return min(rmq[el][a],rmq[el][b+1-(1<<el)]);
}
int main()
{ int m,i,a,b,j;
in>>n>>m;
for(i=1;i<=n;i++)
in>>rmq[0][i];
RMQ();
while(m--){
in>>a>>b;
out<<getmin(a,b)<<'\n';
}
return 0;
}