Pagini recente » Cod sursa (job #468977) | Cod sursa (job #2759449) | Cod sursa (job #2587491) | Cod sursa (job #498982) | Cod sursa (job #3200393)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n,m,v[100002],a[32][100002],p,d[100002],x,y,power,vmin;
int main()
{
fin>>n>>m;
for(int i=1;i<=n;i++)
{
fin>>v[i];
}
for(int i=1;i<=n;i++)
{
a[0][i]=v[i];
}
p=2;
for(int l=1;p<=n;l++)
{
for(int i=1;i+p<=n+1;i++)
{
a[l][i]=min(a[l-1][i],a[l-1][i+p/2]);
}
p=p*2;
}
d[1]=1;
d[2]=2;
p=4;
for(int i=3;i<=n;i++)
{
d[i]=d[i-1];
if(i==p)
{
d[i]++;
p=p*2;
}
}
for(int j=1;j<=m;j++)
{
fin>>x>>y;
power=d[y-x+1];
vmin=min(a[power-1][x],a[power-1][y-power+1]);
fout<<vmin<<'\n';
}
fin.close();
fout.close();
return 0;
}