Cod sursa(job #974558)
| Utilizator | Data | 17 iulie 2013 15:22:47 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.79 kb |
#include <fstream>
#include <vector>
using namespace std;
vector <vector <int> > rmq;
vector <int> bmp;
int n, m;
ifstream fin ("rmq.in");
ofstream fout ("rmq.out");
#define min(a,b) ((a < b) ? a : b)
int main() {
fin >> n >> m;
bmp.resize(n+1);
for (int i = 2; i <= n; ++i)
bmp[i] = bmp[i/2] + 1;
rmq.resize(bmp[n]+1);
for (vector <vector <int> > :: iterator it = rmq.begin(); it != rmq.end(); ++it)
(*it).resize(n+1);
for (int i = 1; i <= n; ++i)
fin >> rmq[0][i];
for (int i = 1; (1 << i) <= n; ++i)
for (int j = 1; j <= n - (1 << i) + 1; ++j)
rmq[i][j] = min(rmq[i-1][j], rmq[i-1][j + (1 << (i - 1))]);
for (int i = 1; i <= m; ++i) {
int x, y;
fin >> x >> y;
int pow = bmp[y-x+1], dif = y - x + 1 - (1 << pow);
fout << min(rmq[pow][x], rmq[pow][x+dif]) << "\n";
}
}
