Tsetso Subarrays

Tsetso likes to play with arrays. An Array $A[1,2,\ldots,N]$ is said to be a Tsetso array if $A[1] \cdot A[N] = max(A_1,A_2,\ldots,A_{N-1},A_N)$. Bedo, his teammate, likes to solve problems so much, so Tsetso gave him an array $A$ of $N$ $\bf{distinct}$ integers $A_1, A_2, \ldots, A_N$ and $Q$ queries of the form $[L, R]$ and asked him to count the number of Tsetso subarrays in the given range.