View Code of Problem 134

import  java.util.*;
public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] nums = new int[n];
        for(int i = 0; i < n; i ++) {
            nums[i] = sc.nextInt();
        }

        int p = sc.nextInt();
        int[][] lr = new int[p][2];
        for(int i = 0; i < p; i++) {
            lr[i][0] = sc.nextInt();
            lr[i][1] = sc.nextInt();

        }

        for(int i = 0; i < p; i++) {
            System.out.println(findMin(nums, lr[i][0], lr[i][1]));
        }
    }

    private static int findMin(int[] nums, int l, int r) {
        int min = nums[l - 1];
        for(int i = l; i <= r - 1; i ++) {
            if(min > nums[i]) {
                min = nums[i];
            }
        }
        return min;
    }
}