Pagini recente » Cod sursa (job #2604683) | Cod sursa (job #2158378) | Cod sursa (job #2972346) | Cod sursa (job #1140556) | Cod sursa (job #3221928)
#include <fstream>
#include <math.h>
using namespace std;
ifstream cin ("rmq.in");
ofstream cout ("rmq.out");
const int dim_vct = 1e5 + 1;
int v[dim_vct], i, j, n, m;
int rmq[dim_vct][30];
void RMQ()
{
for(i = 1; i <= n; i++)
rmq[i][0] = v[i];
for(i = 1; (1 << i) <= n; i++)
for(j = 1; j <= n - (1 << i) + 1; j++)
rmq[j][i] = min(rmq[j][i - 1], rmq[j + 1][i - 1]);
}
int query_RMQ(int l, int r)
{
int putere_nr = log(r - l + 1);
int indice_nr = r - (1 << putere_nr) + 1;
return min(rmq[l][putere_nr], rmq[indice_nr][putere_nr]);
}
int main()
{
cin >> n >> m;
for(i = 1; i <= n; i++)
cin >> v[i];
RMQ();
while(m--)
{
int l, r;
cin >> l >> r;
cout << query_RMQ(l, r) << endl;
}
return 0;
}