Pagini recente » Cod sursa (job #689903) | Cod sursa (job #2924754) | Cod sursa (job #531987) | Cod sursa (job #3275348) | Cod sursa (job #1895297)
#include<fstream>
#define NMAX 100005
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
int n, m, i, j, x, y, lungime, p;
int d[18][NMAX];
int putere(int lungime)
{
int p = 1;
while((1 << p) < lungime)
{
p++;
}
p--;
return p;
}
int main()
{
cin >> n >> m;
for(int i = 1; i <= n; i++)
{
cin >> d[0][i];
}
for(i = 1; (1 << i) <= n; i++)
{
for(j = 1; j <= n; j++)
{
d[i][j] = min(d[i - 1][j],
d[i - 1][j + (1 << (i - 1))]);
}
}
while(m--)
{
cin >> x >> y;
if(x > y)
{
swap(x, y);
}
lungime = y - x + 1;
p = putere(lungime);
cout << min(d[p][x],
d[p][y - (1 << p) + 1]) << "\n";
}
return 0;
}