Pagini recente » Cod sursa (job #1654237) | Cod sursa (job #2139157) | Cod sursa (job #2379159) | Cod sursa (job #2754242) | Cod sursa (job #3135531)
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
vector<vector<int>> construiesteTabelaRara(const vector<int>& arr) {
int n = arr.size();
int log_n = log2(n) + 1;
vector<vector<int>> tabelaRara(n, vector<int>(log_n));
for (int i = 0; i < n; i++) {
tabelaRara[i][0] = arr[i];
}
for (int j = 1; (1 << j) <= n; j++) {
for (int i = 0; i + (1 << j) <= n; i++) {
tabelaRara[i][j] = min(tabelaRara[i][j - 1], tabelaRara[i + (1 << (j - 1))][j - 1]);
}
}
return tabelaRara;
}
int interogare(const vector<vector<int>>& tabelaRara, int stanga, int dreapta) {
int k = log2(dreapta - stanga + 1);
return min(tabelaRara[stanga][k], tabelaRara[dreapta - (1 << k) + 1][k]);
}
int main() {
int N, M;
cin >> N >> M;
vector<int> vectorul(N);
for (int i = 0; i < N; i++) {
cin >> vectorul[i];
}
vector<vector<int>> tabelaRara = construiesteTabelaRara(vectorul);
while (M--) {
int x, y;
cin >> x >> y;
int rezultat = interogare(tabelaRara, x - 1, y - 1);
cout << rezultat << endl;
}
return 0;
}