Pagini recente » Cod sursa (job #1427467) | Cod sursa (job #2124767) | Cod sursa (job #2415633) | Cod sursa (job #1521579) | Cod sursa (job #1668484)
#include <fstream>
using namespace std;
int lg[100003],rmq[100002][18];
int main ()
{
ifstream fin ("rmq.in");
ofstream fout ("rmq.out");
lg[1]=0;
int n,m;
fin>>n>>m;
for (int i=2;i<=n;++i)
{
lg[i]=lg[i/2]+1;
}
for (int i=0;i<n;++i)
{
fin>>rmq[i][0];
}
for (int i=1;i<=lg[n];++i)
{
for (int j=0;j+(1<<i)-1<=n;++j)
{
rmq[j][i]=min (rmq [j][i-1], rmq [j+(1<<(i-1))][i-1]);
}
}
int x,y;
for (int i=0;i<m;++i)
{
fin>>x>>y;
x--;y--;
int diff=y-x+1;
fout<<min(rmq [x][lg[diff]],rmq [y-(1<<lg[diff])+1][lg[diff]])<<"\n";
}
}