Pagini recente » Cod sursa (job #2291992) | Cod sursa (job #1284903) | Cod sursa (job #2529782) | Cod sursa (job #2618185) | Cod sursa (job #1543659)
#include <iostream>
#include <stdio.h>
using namespace std;
int a[20][100001],n,m,i,j,dif,linie,x,y,lg[100001];
int main()
{
freopen("rmq.in","r",stdin);
freopen("rmq.out","w",stdout);
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)
scanf("%d",&a[0][i]);
for(i=1;(1<<i)<=n;i++)
for(j=1;j+(1<<i)-1<=n;j++)
a[i][j]=min(a[i-1][j],a[i-1][j+(1<<(i-1))]);
lg[1]=0;
for(i=2;i<=n;i++)
lg[i]=lg[i/2]+1;
while(m){
scanf("%d%d",&x,&y);
m--;
dif=y-x+1;
linie=lg[dif];
int Min=min(a[linie][x],a[linie][y-(1<<linie)+1]);
printf("%d\n",Min);
}
return 0;
}