Pagini recente » Cod sursa (job #865517) | Cod sursa (job #2581063) | Cod sursa (job #842901) | Cod sursa (job #2718461) | Cod sursa (job #2948047)
#include <fstream>
using namespace std;
ifstream fin ("rmq.in");
ofstream fout ("rmq.out");
int lg[100005];
int rmq[100005][20];
int n,m,l,r,i,j,k,p,d;
int pow (int x)
{
int answ = 1;
for (i=1;i<=x;i++)
answ = answ * 2;
return answ;
}
int main()
{
ios::sync_with_stdio(false);
fin.tie(0);
fout.tie(0);
lg[1] = 0;
fin >> n >> m;
for (i=2;i<=n;i++)
lg[i] = lg[i/2] + 1;
for (i=1;i<=n;i++)
fin >> rmq[i][0];
for (j=1;j<=lg[n];j++)
for (i=1;i + (1<<j)-1 <=n;i++)
rmq[i][j] = min(rmq[i][j-1],rmq[i + (1<<(j-1))][j-1]);
for (k=1;k<=m;k++)
{
fin >> l >> r;
if (l > r)
swap(l,r);
d = r-l+1;
p = lg[d];
fout << min(rmq[l][p],rmq[r - (1<<p) + 1][p]) << '\n';
}
return 0;
}