Subarray Weight

You are given a [permutation](https://en.wikipedia.org/wiki/Permutation) $P$ of $N$ integers from $1$ to $N$. The *weight* of a subarray $[L, R]$ $(1\le L \le R \le N)$ is defined as $|i - j|$ where $i$ denotes the index of the **maximum** element and $j$ denotes the index of the **minimum** element in the subarray $[L,R]$. Find the **sum** of the *weights* of **all** subarrays of the given pe