Pagini recente » Cod sursa (job #636259) | Cod sursa (job #1860176) | Cod sursa (job #2862766) | Cod sursa (job #453868) | Cod sursa (job #2841449)
#include <fstream>
#include <cmath>
using namespace std;
const int SIZE = 1e5+10;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
int n, m, mat[20][SIZE], a, b, l;
int p2[SIZE];
int main()
{
p2[1] = 0;
for(int i=2; i<SIZE; i++)
p2[i] = p2[i/2] + 1;
cin>>n>>m;
for(int i=1; i<=n; i++) cin>>mat[0][i];
for(int i=1; i<=p2[n]; i++)
for(int j=1; j<=n-(1<<i)+1; j++)
mat[i][j] = min(mat[i-1][j], mat[i-1][j+(1<<(i-1))]);
while(m--)
{
cin>>a>>b;
l = b-a+1;
cout<<min(mat[p2[l]][a], mat[p2[l]][b-p2[l]])<<'\n';
}
return 0;
}