Pagini recente » Cod sursa (job #670761) | Cod sursa (job #788590) | Cod sursa (job #976834) | Cod sursa (job #2052086) | Cod sursa (job #2383260)
#include <fstream>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n,m[100002][20],i,j,a[100005],lg[100005],q,x,y,p;
int main()
{
f>>n>>q;
for(i=1;i<=n;i++) f>>a[i];
lg[1]=0;
for(i=2;i<=n;i++) lg[i]=lg[i/2]+1;
for(i=1;i<=n;i++) m[i][0]=a[i];
for(j=1;(1<<j)<=n;j++)
for(i=1;i+(1<<j)-1<=n;i++)
{
m[i][j]=min(m[i][j-1],m[i+(1<<(j-1))][j-1]);
}
for(i=1;i<=q;i++)
{
f>>x>>y;
p=lg[y-x+1];
g<<min(m[x][p],m[y-p][p])<<'\n';
}
return 0;
}