✅Array Proximity (Contest)

Array Proximity (Contest) easy Time Limit: 2 sec Memory Limit: 128000 kB

Problem Statement :

You are given an array A of size N. Over all pairs of (l, r) (1 <= l < r <= n), find the maximum value of max(Al, Al+1,... , Ar) * min(Al, Al+1,... , Ar). Input The first line of the input contains a single integer N. The second line of the input contains N space seperated integers.

Constraints: 1 <= N <= 105 1 <= Ai <= 109 Output Over all pairs of (l, r) (1 <= l < r <= n), print the maximum value of max(Al, Al+1,. , Ar) * min(Al, Al+1,. , Ar). Example Sample Input: 4 2 3 2 1

Sample Output: 6

Explaination: Let l = 1, r = 3 max = 3, min = 2 value = 3*2 = 6. It can be verified that this is the maximum such value possible.

link:https://my.newtonschool.co/playground/code/336kvwwxdf23/

import java.io.*; // for handling input/output
import java.util.*; // contains Collections framework

// don't change the name of this class
// you can add inner classes if needed
class Main {
    public static void main (String[] args)throws Exception {
        // Your code here
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int n = Integer.parseInt(br.readLine());
        long[] a= new long[n];

        String[] line = br.readLine().split(" ");
        for(int i=0;i<n;i++){
            a[i] = Long.parseLong(line[i]);
        }
        int i =0,j=i+1;
        long prod = a[i]*a[j];
        while(j<n-1){
            i++;
            j++;
            prod = Math.max(prod,(a[i]*a[j]));
        }
        System.out.println(prod);
    }
}