Pagini recente » Cod sursa (job #63284) | Cod sursa (job #2774563) | Cod sursa (job #1932867)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n, m, v[100001], lg[100001], rmq[18][100001];
int main()
{
fin>>n>>m;
lg[0] = -1;
for(int i = 1; i <= n; i++) {
fin>>v[i];
rmq[0][i]=v[i];
lg[i]=lg[i/2]+1;
}
for(int i = 1; i <= lg[n] + 1; i++) {
int l = 1 << (i - 1);
for (int j = 1; j <= n - (l<<1) + 1; j++)
rmq[i][j] = min(rmq[i-1][j], rmq[i-1][j + l]);
}
int x, y;
for(int j = 1; j <= m; j++) {
fin>>x>>y;
int diff = y - x + 1;
int rand = lg[diff];
int l = 1 << rand;
fout<<min(rmq[rand][x], rmq[rand][y - l + 1])<<'\n';
}
fin.close();
fout.close();
return 0;
}