Pagini recente » Cod sursa (job #2274231) | Cod sursa (job #2791449) | Cod sursa (job #3194574) | Cod sursa (job #25648) | Cod sursa (job #2754005)
#include <fstream>
using namespace std;
int main()
{
ifstream fin("rmq.in");
ofstream fout("rmq.out");
long long n,m;
fin>>n>>m;
long long a[10000],lg[10000],rmq[20][10000];
for(int i=0;i<n;i++)
fin>>a[i];
lg[1]=0;
for (int i=2;i<=n;i++)
lg[i]=lg[i/2]+1;
for (int i=1;i<=n;i++)
rmq[0][i]=a[i];
int l;
for(int i=1;(1<<i)<=n;i++)
for(int j=1;j<=n-(1<<i)+1;j++)
{
l=1<<(i-1);
rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+1]);
}
long long x,y,diff,sh;
for(int i=0;i<m;i++)
{
fin>>x>>y;
diff=y-x+1;
l=lg[diff];
sh=diff-(1<<l);
fout<<min(rmq[l][x],rmq[l][x+sh])<<'\n';
}
return 0;
}