Pagini recente » Cod sursa (job #1841581) | Cod sursa (job #2702606) | Borderou de evaluare (job #2830570) | Cod sursa (job #668905) | Cod sursa (job #3261602)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
int n, m, dr, st;
vector<int> E;
vector<vector<int>> r;
void precalc()
{
for(int p=1; (1<<p) <= n; p++)
for(int i=1; i<=n; i++)
{
r[p][i] = r[p-1][i];
int j = i + (1 << (p-1));
if(j <= n && r[p][i] > r[p-1][j])
r[p][i] = r[p-1][j];
}
for(int i=2; i<=n; i++)
E[i] = E[i/2] + 1;
}
int main()
{
cin >> n >> m;
r.assign(20, vector<int>(n+1, 0));
E.resize(n+1);
for(int i=1; i<=n; i++)
cin >> r[0][i];
precalc();
while(m--)
{
cin >> st >> dr;
int exp = E[dr - st + 1];
int ans = min(r[exp][st], r[exp][dr - (1<<exp) + 1]);
cout << ans << '\n';
}
return 0;
}