Pagini recente » Cod sursa (job #1433316) | Cod sursa (job #2120605) | Cod sursa (job #2717773) | Cod sursa (job #1048922) | Cod sursa (job #1466756)
#include<fstream>
#include<vector>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
#define NMAX 100002
#define LMAX 18
long int rmq[LMAX][NMAX];
long int n,m;
long int lg[NMAX];
long int a[NMAX];
int main()
{
long int i,j,l;
f>>n>>m;
for(i=1;i<=n;i++)
f>>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]=min(rmq[i-1][j],rmq[i-1][j+l]);
}
long int x,y,diff,sh;
for(i=1;i<=m;i++)
{
f>>x>>y;
diff=y-x+1;
l=lg[diff];
sh=diff-(1<<l);
g<<min(rmq[l][x],rmq[l][x+sh])<<"\n";
}
return 0;
}