Pagini recente » Cod sursa (job #2694408) | Cod sursa (job #2804431) | Cod sursa (job #1830101) | Cod sursa (job #2444222) | Cod sursa (job #2026243)
#include <fstream>
#include <algorithm>
#define DIM 100010
using namespace std;
int n, m;
int rmq[DIM][20], lg[DIM];
inline void CreateLg()
{
lg[1] = 0;
for (int i = 2;i <= n;++i)
lg[i] = lg[i >> 1] + 1;
}
int main()
{
ifstream f("rmq.in");
ofstream g("rmq.out");
f >> n >> m;
for (int i = 1;i <= n;++i)
{
int x;
f >> x;
rmq[i][0] = x;
}
CreateLg();
for (int p = 1;(1 << p) <= n;++p)
for (int i = 1;i + (1 << p) - 1 <= n;++i)
rmq[i][p] = min(rmq[i][p - 1], rmq[i + (1 << (p - 1))][p - 1]);
for (int i = 1;i <= m;++i)
{
int x, y;
f >> x >> y;
int p = lg[y - x + 1];
g << min(rmq[x][p], rmq[y - (1 << p) + 1][p]) << "\n";
}
f.close();
g.close();
return 0;
}