Pagini recente » Cod sursa (job #2174482) | Cod sursa (job #264504) | Cod sursa (job #1396206) | Cod sursa (job #942672) | Cod sursa (job #1147244)
#include <stdio.h>
#include <vector>
#include <iostream>
#include<fstream>
using namespace std;
#define NMAX 100002
#define LMAX 18
long int rmq[LMAX][NMAX];
long int n,m;
long int lg[NMAX];
long int a[NMAX];
ifstream in ("rmq.in");
ofstream out ("rmq.out");
int minim (int a1,int b1)
{
if (a1<b1) return a1;
return b1;
}
int main()
{
long int i,j,l;
in>>n>>m;
for (i=1;i<=n;i++)
in>>a[i];
lg[1]=0;
for (i=2;i<=n;i++)
lg[i]=lg[i/2]+1;
for (i=1;i<=n;i++)
rmq[0][i]=a[i];
for (i=1; (1 << i) <=n;i++)
for (j=1;j <= n - (1 << i)+1;j++)
{
l=1<<(i-1);
rmq[i][j]= minim( rmq[i-1][j] , rmq[i-1][j+l] );
}
long int x,y,diff,sh;
for (i=1;i<=m;i++)
{
in>>x>>y;
diff=y-x+1;
l=lg[diff];
sh=diff - (1<<l);
out<<minim(rmq[l][x],rmq[l][x+sh])<<"\n";
}
return 0;
}