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