Pagini recente » Cod sursa (job #2400717) | Cod sursa (job #1365485) | Cod sursa (job #286347) | Cod sursa (job #899602) | Cod sursa (job #2907063)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
#define NMAX 100002
#define LMAX 18
long int rmq[LMAX][NMAX];
long int n, m;
long int lg[NMAX];
long int a[NMAX];
int main()
{
fin >> n >> m;
for (long int i = 1; i <= n; i++)
fin >> a[i];
lg[1] = 0;
for (long int i=2; i <= n; i++)
lg[i] = lg[i / 2] + 1;
for (long int i = 1; i <= n; i++)
rmq[0][i] = a[i];
for (long int i = 1; (1 << i) <= n; i++)
for (long int j = 1;j <= n - (1 << i) + 1; j++)
{
long int l = 1 << (i - 1);
rmq[i][j]= min( rmq[i - 1][j], rmq[i - 1][j + l] );
}
long int x,y,diff,sh;
for (long int i = 1; i <= m; i++)
{
fin >> x >> y;
diff = y - x + 1;
long int l = lg[diff];
sh = diff - (1 << l);
fout << min(rmq[l][x], rmq[l][x + sh]) << '\n';
}
return 0;
}