Pagini recente » Cod sursa (job #2580163) | Cod sursa (job #2743988) | Cod sursa (job #3005468) | Cod sursa (job #2865429) | Cod sursa (job #2067429)
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int v[100002];
int a[22][100002];
int lg[100002];
int main()
{
int n,m;
fin>>n>>m;
for(int i=1;i<=n;i++)
{
fin>>v[i];
}
lg[0]=1;
for(int i=2;i<=n;i++)
{
lg[i]=lg[i/2]+1;
}
for(int i=1;i<=n;i++)
{
a[0][i]=v[i];
}
for(int i=1;(1<<i)<=n;i++)
{
for(int j=1;j+(1<<i)-1<=n;j++)
{
a[i][j]=min(a[i-1][j],a[i-1][j+(1<<(i-1))]);
}
}
int x,y;
for(int i=1;i<=m;i++)
{
fin>>x>>y;
int d=y-x+1;
int k=lg[d];
fout<<min(a[k][x],a[k][y+1-(1<<k)])<<"\n";
}
return 0;
}