Pagini recente » Cod sursa (job #2563611) | Cod sursa (job #2891294) | Cod sursa (job #2753216) | Cod sursa (job #2460832) | Cod sursa (job #3129798)
#include <fstream>
using namespace std;
const int N = 1e5;
const int L = 16;
int log2[N+1], r[L+1][N+1];
int main()
{
ifstream in("rmq.in");
ofstream out("rmq.out");
int n, q;
in >> n >> q;
for (int j = 1; j <= n; j++)
{
in >> r[0][j];
}
///construim matricea r
for (int i = 1; (1 << i) <= n; i++)
{
for (int j = (1 << i); j <= n; j++)
{
int p = 1 << (i - 1);
r[i][j] = min(r[i-1][j-p], r[i-1][j]);
}
}
///construim vectorul log2
log2[1] = 0;
for (int i = 2; i <= n; i++)
{
log2[i] = 1 + log2[i/2];
}
for (int i = 0 ; i < q; i++)
{
int st, dr;
in >> st >> dr;
int e = log2[dr-st+1];
int p = 1 << e;
out << min(r[e][st+p-1], r[e][dr]) << "\n";
}
in.close();
out.close();
return 0;
}