Pagini recente » Cod sursa (job #902480) | Cod sursa (job #233642) | Cod sursa (job #677285) | Cod sursa (job #2815316) | Cod sursa (job #3291031)
#include <fstream>
#include <vector>
using namespace std;
vector <int> log2;
vector <vector <int>> r;
void constructie_log2(int n)
{
log2.resize(n + 1);
log2[1] = 0;
for (int i = 2; i <= n; i++)
{
log2[i] = 1 + log2[i/2];
}
}
int minim(int st, int dr)
{
int exp = log2[dr-st+1];
int p = (1 << exp);
return min(r[exp][st+p-1], r[exp][dr]);
}
int main()
{
ifstream in("rmq.in");
ofstream out("rmq.out");
int n, q;
in >> n >> q;
constructie_log2(n);
r.resize(log2[n] + 1);
r[0].resize(n + 1);
for (int j = 1; j <= n; j++)
{
in >> r[0][j];
}
for (int i = 1; i <= log2[n]; i++)
{
r[i].resize(n + 1);
int p = (1 << (i - 1));
for (int j = (1 << i); j <= n; j++)
{
r[i][j] = min(r[i-1][j-p], r[i-1][j]);
}
}
for (int i = 0; i < q; i++)
{
int st, dr;
in >> st >> dr;
out << minim(st, dr) << "\n";
}
in.close();
out.close();
return 0;
}