Pagini recente » Cod sursa (job #790877) | Cod sursa (job #490132) | Cod sursa (job #277428) | Cod sursa (job #821407) | Cod sursa (job #2771184)
#include <fstream>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
int n,m,vmin[100010][25],rp[25],p[100010],x,y;
int main()
{
in>>n>>m;
for(int i=1;i<=n;++i)
in>>vmin[i][0];
rp[0]=1;
for(int i=1;i<=17;++i)
{
rp[i]=rp[i-1]*2;
if(i<17)
p[rp[i]]=i;
}
for(int j=1;rp[j]<=n;++j)
{
for(int i=1;i+rp[j]-1<=n;++i)
vmin[i][j]=min(vmin[i][j-1],vmin[i+rp[j-1]][j-1]);
}
for(int i=1;i<=n;++i)
if(p[i]==0)
p[i]=p[i-1];
for(int i=1;i<=m;++i)
{
in>>x>>y;
if(y<x)
swap(x,y);
out<<min(vmin[x][p[y-x+1]],vmin[y-rp[p[y-x+1]]+1][p[y-x+1]])<<'\n';
}
return 0;
}