View Code of Problem 134

#include<iostream>

using namespace std;

int main()
{
    int n,q,l,r;
    int a[100001];
    while(cin >> n){
        for(int i = 0; i < n; i++)
            cin >> a[i];
        cin >> q;
        while(q--){
            cin >> l >> r;
            int min = a[l-1];
            for(int i = l-1; i < r; i++){
                if(min > a[i])
                    min = a[i];
            }
            cout << min <<endl;
        }
    }
}