Pagini recente » Istoria paginii utilizator/danrr | Cod sursa (job #2699297) | Cod sursa (job #1257838) | Cod sursa (job #1543134) | Cod sursa (job #2757858)
#include <bits/stdc++.h>
#define NMAX 100002
#define LMAX 18 //?
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
long int rmq[NMAX][LMAX] , n , m , v[NMAX] , lg2[NMAX];
int main()
{
fin >> n >> m;
for(int i = 1 ; i <= n ; i++)
fin >> v[i];
lg2[1] = 0;
for(int i = 2 ; i <= n ; i++)
lg2[i] = lg2[i/2] + 1;
for(int i = 1 ; i <= n ; i++)
rmq[i][0] = v[i];
for(int j = 1 ; (1 << j) <= n ; j++)
for(int i = 1 ; i + (1 << j) - 1 <= n ; i++)
rmq[i][j] = min( rmq[i][j-1] , rmq[i+(1<<(j-1))][j-1] );
for(int i = 1 ; i <= m ; i++)
{
long int x , y , k , dist;
fin >> x >> y;
dist = y - x + 1;
k = lg2[dist];
fout << min(rmq[x][k] , rmq[x + (dist - (1 << k))][k]) << '\n';
}
return 0;
}