Pagini recente » Cod sursa (job #1444839) | Cod sursa (job #37615) | Cod sursa (job #1308499) | Cod sursa (job #2369831) | Cod sursa (job #2581625)
#include <bits/stdc++.h>
#define MAX 100100
#define MAX2 18
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int a[MAX];
int c[MAX][MAX2];
int main()
{
int i,j,q,n,m,k;
fin>>n>>m;
for(i=1;i<=n;i++)
fin>>a[i];
for(i=1;i<=n;i++)
c[i][0]=i;
for(j=1;(1<<j)<=n;j++)
for(i=1;i+(1<<j)-1<=n;i++)
if(a[c[i][j-1]]<a[c[i+(1<<(j-1))][j-1]])
c[i][j]=c[i][j-1];
else
c[i][j]=c[i+(1<<(j-1))][j-1];
for(q=1;q<=m;q++)
{
fin>>i>>j;
k=log2(j-i+1);
fout<<min(a[c[i][k]],a[c[j-(1<<k)+1][k]])<<'\n';
}
return 0;
}