View Code of Problem 134

#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<climits>
#include<cmath>
#include<map>
#include<set>
#include<queue>

using namespace std;


int main()
{
	int n;
	while (cin >> n) {

		vector<int> nums(n);
		for (int i = 0; i < n; i++)
			cin >> nums[i];

		vector<int> dp(n);
		dp[0] = nums[0];

		for (int i = 1; i < n; i++)
			dp[i] = min(nums[i], nums[i - 1]);

		int q;
		cin >> q;

		for (int i = 0; i < q; i++) {

			int l, r;
			cin >> l >> r;

			cout << min(dp[l - 1], dp[r - 1]) << endl;
		}
	}
}