View Code of Problem 134

#include <map>
#include "stdlib.h"
#include<stdio.h>
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <string>
#include <iomanip>
#include "math.h"
using namespace std;
map<char, int> mp;


int main()
{
	int n,q,l,r,min; cin >> n; int x[100000];
	for (int i = 1; i <= n; i++)scanf("%d",&x[i]);
	cin >> q;
	while (q--)
	{
		cin >> l >> r;
		min = x[l];
		for (int i = l + 1; i <= r; i++)
		{
			if (x[i] < min)min = x[i];
		}
		cout << min << endl;
	}
	return 0;
}