Pagini recente » Cod sursa (job #154226) | Cod sursa (job #2870997) | Cod sursa (job #1635380) | Cod sursa (job #2418516) | Cod sursa (job #1254439)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
const int NMAX = 100002;
const int LMAX = 18;
int rmq[LMAX][NMAX];
int n, m;
int lg[NMAX];
int a[NMAX];
int x, y, z, sh;
int main()
{
fin >> n >> m;
for ( int i = 1; i <= n; i++)
fin >> a[i];
lg[1]=0;
for (int i = 2; i <= n; i++)
lg[i] = lg[i/2] + 1;
for ( int i = 1; i <= n; i++)
rmq[0][i] = a[i];
for ( int i = 1; (1 << i) <= n; i++)
for (int j = 1; j <= n - (1 << i) + 1; j++)
{
z = 1 << (i-1);
rmq[i][j] = min( rmq[i-1][j] , rmq[i-1][j+z] );
}
for (int i=1;i<=m;i++)
{
fin >> x >> y;
z=lg[y - x + 1];
sh=y - x + 1 - (1<<z);
fout << min( rmq[z][x],rmq[z][x+sh] ) << '\n';
}
return 0;
}