Pagini recente » Cod sursa (job #3309486) | Cod sursa (job #954291) | Cod sursa (job #1884203) | Cod sursa (job #2347872) | Cod sursa (job #3350906)
#include <fstream>
using namespace std;
ifstream cin ("rmq.in");
ofstream cout ("rmq.out");
int rmq[18][100001];
int v[100001];
int putere2[100001];
int main()
{
int n,m;
cin >>n>>m;
for (int i = 1; i <= n; i++)
{
cin >>v[i];
rmq[0][i] = v[i];
}
for (int i = 1; (1 << i) <= n; i++)
{
for (int j = 1; j <= n; j++)
{
rmq[i][j] = rmq[i - 1][j];
int nr = (1 << (i - 1));
if (j + nr <= n && rmq[i][j] >= rmq[i - 1][j + nr])
{
rmq[i][j] = rmq[i - 1][j + nr];
}
}
}
for (int i = 2; i <= n; i++)
{
putere2[i] = putere2[i / 2] + 1;
}
for (int i = 1; i <= m; i++)
{
int st,dr;
cin >>st>>dr;
int nr = putere2[dr - st + 1];
cout <<min(rmq[nr][st] , rmq[nr][dr - (1 << nr) + 1])<<"\n";
}
return 0;
}