Pagini recente » Cod sursa (job #171847) | Cod sursa (job #571924) | Cod sursa (job #2390400) | Cod sursa (job #2157839) | Cod sursa (job #667987)
Cod sursa(job #667987)
#include<fstream>
#include <vector>
using namespace std;
long int rmq[18][100001];
long int n,m;
long int lg[100001];
long int a[100001];
int main()
{
ifstream fin("rmq.in");
ofstream fout("rmq.out");
fin>>n>>m;
for(int i=1;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];
for(int i=1; (1 << i) <=n;i++)
for(int j=1;j <= n - (1 << i)+1;j++)
{
int l=1<<(i-1);
rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+l]);
}
long int x,y,diff,sh;
for (;m;--m)
{
int l;
fin>>x>>y;
diff=y-x+1;
l=lg[diff];
sh=diff - (1<<l);
fout<<min(rmq[l][x],rmq[l][x+sh])<<"\n";
}
}