Pagini recente » Cod sursa (job #680388) | Cod sursa (job #2560533) | Cod sursa (job #2747763) | Cod sursa (job #462397) | Cod sursa (job #2038065)
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n,m,a[20][100001],log[100001],x,y,lg;
int Logaritm(int n)
{
if(n==1)
return 0;
else
return Logaritm(n/2)+1;
}
int main()
{
fin>>n>>m;
for(int i=1;i<=n;i++)
{
fin>>a[0][i];
log[i]=Logaritm(i);
}
for(int i=1;i<=log[n];i++)
{
for(int j=1;j<=n-(1<<i)+1;j++)
a[i][j]=min(a[i-1][j],a[i-1][j+(1<<(i-1))]);
}
while(m)
{
m--;
fin>>x>>y;
lg=log[y-x+1];
fout<<min(a[lg][x],a[lg][y-(1<<lg)+1])<<"\n";
}
return 0;
}