View Code of Problem 134

//区间最值
#include<stdio.h>

int foundmin(int xulie[], int l, int r)
{
	int min = xulie[l-1];
	for (int a = l; a <= r - 1; a++)
	{
		if (min > xulie[a])
			min = xulie[a];
	}
	return min;
}

int main()
{
	int xulie[100000], n, q, l, r,min;
	while (scanf("%d", &n) != EOF)
	{
		for (int i = 0; i < n; i++)
		{
			scanf("%d", &xulie[i]);
		}
		scanf("%d", &q);
		int a = 0;
		while (a < q)
		{
			scanf("%d %d", &l, &r);
			min=foundmin(xulie, l, r);
			printf("%d\n", min);
		}
	}
	return 0;
}