ARRAYCOUPLE

Consider an array of n integers, A = [$a_1$, $a_2$,..., $a_n$]. Find and print the total number of ($i$, $j$) pairs such that $a_i$ $\times$ $a_j$ $\leq$ max ($a_i$, $a_i+1$,..., $a_j$) where $i$ < $j$. ### Input - The first line contains an integer,$n$, denoting the number of elements in the array. - The second line consists of $n$ space-separated integers describing the respective values of $a_