Pagini recente » Cod sursa (job #3182878) | Cod sursa (job #2211369) | Cod sursa (job #3135492) | Cod sursa (job #1205915) | Cod sursa (job #305365)
Cod sursa(job #305365)
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#define MAXN 100001
#define MAXLOG 21
int minim(int a,int b)
{
if (a<b) return a;
else return b;
}
int st[MAXN][MAXLOG],a[MAXN];
int main()
{
int i,j,n,m,k,l,r;
freopen("rmq.in","r",stdin);
freopen("rmq.out","w",stdout);
scanf("%d %d",&n,&m);
for (i=0;i<n;i++)
{
scanf("%d",a+i);
st[i][0]=a[i];
}
for (j=1;(1<<j)<=n;j++)
for (i=0;i+(1<<j)-1<n;i++)
st[i][j]=minim(st[i][j-1],st[i+(1<<(j-1))][j-1]);
for (i=0;i<m;i++)
{
scanf("%d %d",&l,&r);
l--;r--;
k=floor(log(l-r+1)/log(2));
printf("%d\n",minim(st[l][k],st[r-(1<<k)+1][k]));
}
fclose(stdout);
}