Pagini recente » Cod sursa (job #512495) | Cod sursa (job #2520859) | Cod sursa (job #459796) | Cod sursa (job #3228791) | Cod sursa (job #2378164)
#include <bits/stdc++.h>
#define DMAX 100000
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int M[DMAX][20];
int a[DMAX];
void procesare();
int n,m,k;
int main()
{int i,y,x,k;
fin>>n>>m;
for(i=1;i<=n;i++)
fin>>a[i];
procesare();
for(i=1;i<=m;i++)
{
fin>>x>>y;
k=log2(y-x+1);
if(a[M[x][k]]<=a[M[y-(1<<k)+1][k]])
fout<<a[M[x][k]]<<'\n';
else
fout<<a[M[y-(1<<k)+1][k]]<<'\n';
}
return 0;
}
void procesare()
{int i,j;
for(i=1;i<=n;i++)
M[i][0]=i;
for(j=1;(1<<j)<=n;j++)
for(i=1;i+(1<<j)-1<=n;i++)
if(a[M[i][j-1]]<=a[M[i+(1<<j)-1][j-1]])
M[i][j]=M[i][j-1];
else
M[i][j]=M[i+(1<<j)-1][j-1];
}