Sortable Subarrays

An array is called sortable if it can be sorted in non-descending order using the following operations several times (possibly $0$ times): - Choose index $i$, and multiply $A_i$ by $-1$. For example, $[3, 2, 1, 1, 2]$ can form $[-3, -2, 1, 1, 2]$ which is sorted. You are given an array of $N$ positive integers - $[A_1, A_2, \ldots, A_N]$. Find the number of pairs $L$ and $R$ such that - $1 \l