Pagini recente » Cod sursa (job #2941463) | Cod sursa (job #1172681) | Cod sursa (job #2897222) | Cod sursa (job #718655) | Cod sursa (job #2625320)
#include <fstream>
#define NMAX 100001
#define NLOGMAX 18
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int a[NMAX][NLOGMAX], v[NMAX], log[NMAX];
int n, m;
int main()
{
fin >> n >> m;
for (int i = 1; i <= n; i++)
{
fin >> v[i];
a[i][0] = v[i];
}
log[1] = 0;
for (int i = 2; i <= n; i++)
log[i] = log[i / 2] + 1;
for (int j = 1; (1 << j) <= n; j++)
for (int i = 1; i + (1 << j) - 1 <= n; i++)
{
int k = 1 << (j - 1);
a[i][j] = min(a[i][j - 1], a[i + k][j - 1]);
}
for (int i = 1; i <= m; i++)
{
int x, y;
fin >> x >> y;
int k = log[y - x + 1];
int dif = (1 << k) - 1;
fout << min(a[x][k], a[y - dif][k]) << '\n';
}
return 0;
}