Sum of Imbalance Numbers of All Subarrays

Compute the sum, over all contiguous subarrays, of the number of “gaps” in the sorted subarray where consecutive sorted values differ by more than 1. The challenge is to avoid enumerating subarrays by counting each element/pair’s contribution to subarrays (using combinatorial counting or monotonic-stack/next-prev occurrence techniques) to get the aggregate efficiently.