Pagini recente » Cod sursa (job #2633261) | Cod sursa (job #329512) | Cod sursa (job #1999914) | Cod sursa (job #2835845) | Cod sursa (job #2019650)
#include <fstream>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
const int NMAX = 100005;
const int LGMAX = 20;
long rmq[LGMAX][NMAX],lg[NMAX];
int main()
{
long n,m,x,y,diff,sh,l,i,j;
in >> n >> m;
for (i = 1; i<=n; i++)
in >> rmq[0][i];
lg[1] = 0;
for (i = 2; i<=n; i++)
lg[i] = lg[i/2]+1;
for (i = 1; (1<<i)<=n; i++)
for (j = 1; j<= n-(1<<i)+1; j++)
{
l = 1<<(i-1);
rmq[i][j] = min(rmq[i-1][j],rmq[i-1][l+j]);
}
for (i = 1; i<=m; i++)
{
in >> x >> y;
diff = y-x+1;
l = lg[diff];
sh = diff - (1<<l);
out << min(rmq[l][x],rmq[l][x+sh]) << "\n";
}
}