Pagini recente » Cod sursa (job #2534190) | Cod sursa (job #827973) | Cod sursa (job #1411975) | Cod sursa (job #3143929) | Cod sursa (job #2789294)
#include <fstream>
#define mF "rmq"
std::ifstream in(mF ".in");
std::ofstream out(mF ".out");
constexpr int L(int e) {return e? L(e >> 1) + 1: 0;}
constexpr int N = 100000; int V[L(N)][N];
int main()
{
int n, m; in >> n >> m;
for (int i = 0; i < n; i++) in >> (*V)[i];
for (int i = 1, l = L(n); i < l; i++)
for (int j = 0; j + (1 << i) <= n; j++)
V[i][j] = std::min(V[i-1][j],
V[i-1][j + (1 << i-1)]);
while (m--){
int a, b, l; in >> a >> b; l = L(b - (--a)) - 1;
out << std::min(V[l][a], V[l][b - (1 << l)]) << '\n';}
}