Pagini recente » Cod sursa (job #3197271) | Cod sursa (job #943448) | Cod sursa (job #476726) | Cod sursa (job #2020453) | Cod sursa (job #3221938)
#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], lungime[dim_vct];
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++)
{
int l = 1 << (i - 1);
rmq[j][i] = min(rmq[j][i - 1], rmq[j + l][i - 1]);
}
/// Calcul lungimi
lungime[1] = 0;
for(i = 2; i <= n; i++)
lungime[i] = lungime[i / 2] + 1;
}
int query_RMQ( int st, int dr )
{
int dist = dr - st + 1;
int putere_dist = lungime[dist];
int dist_max_pe_coloana = dist - (1 << putere_dist);
return min(rmq[dr][putere_dist], rmq[dr + dist_max_pe_coloana][putere_dist]);
}
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;
}