Pagini recente » Cod sursa (job #2470445) | Cod sursa (job #173399) | Cod sursa (job #2076714) | Cod sursa (job #30864) | Cod sursa (job #1518940)
#include<fstream>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n,m,mat[22][10001],lg[100100],x,y;
void citire()
{
f>>n>>m;
for(int i=1;i<=n;++i)
{
f>>mat[0][i];
}
}
inline int minim(int x,int y)
{
int lin=lg[y-x+1];
return mat[lin][x]<mat[lin][y-(1<<(lin))+1]?mat[lin][x]:mat[lin][y-(1<<(lin))+1];
}
void rmq()
{ lg[1]=0;
for(int i=2;i<=n;++i)
lg[i]=lg[i>>1]+1;
for(int i=1;(1<<i)<=n;++i)
for(int j=1;j<=n-(1<<i)+1;++j)
mat[i][j]=mat[i-1][j]<mat[i-1][j+(1<<(i-1))]?mat[i-1][j]:mat[i-1][j+(i<<(i-1))];
for(;m;--m)
{
f>>x>>y;
g<<minim(x,y)<<'\n';
}
}
int main()
{
citire();
rmq();
f.close();
return 0;
}