Pagini recente » Cod sursa (job #215983) | Cod sursa (job #2749109) | Cod sursa (job #362182) | Cod sursa (job #3221167) | Cod sursa (job #1232052)
#include <fstream>
using namespace std;
int rmq[10000][10000], v[10000];
int compute (int v[10000], int x, int y)
{
int min = 100001;
for (int i = x; i <= y; ++i)
if (v[i] < min)
min = v[i];
return min;
}
void preprocess(int rmq[10000][10000], int v[10000], int n)
{
for (int i = 0; i < n; ++i)
for (int j = i + 1; j < n; ++j)
rmq[i][j] = compute(v, i, j);
}
int main()
{
ifstream in ("rmq.in");
ofstream out("rmq.out");
int n, m; in >> n >> m;
for (int i = 0; i < n; ++i)
in >> v[i];
preprocess (rmq, v, n);
for (int i = 0; i < m; ++i)
{
int x, y; in >> x >> y;
--x; --y;
out << rmq[x][y] << "\n";
}
return 0;
}