区间最小值 RMQ

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
#define maxn 108
int n,d[maxn][maxn];
int A[maxn];
inline int min(int a,int b)
{
	return a>b?b:a;
}

void RMQ_init()
{
	for(int i = 1;i <= n;i++)	d[i][0] = A[i];
	for(int j = 1;(1 << j) <= n;j++)
	{
		for(int i = 1;i + (1 << j) - 1 <= n;i++)
		{
			d[i][j] = min(d[i][j-1],d[i+(1<<(j-1))][j-1]);
		}
	}
}

int RMQ(int l,int r)
{
	int k = 0;
	while((1 << (k+1)) <= r - l + 1) k++;
	return min(d[l][k],d[r-(1<<k)+1][k]);
}

int main()
{
	while(scanf("%d",&n)!=EOF)
	{
		for(int i = 1;i <= n;i++)
			scanf("%d",&A[i]);
		RMQ_init();
		int u,v;
		while(scanf("%d%d",&u,&v)==2)
		{
			printf("%d\n",RMQ(u,v));
		}
	}
	return 0;
}