• + 18 comments

    Hint to begin with. Find maximum value and sort subarrays in the left and in the right. Count eficienly (subarrays are sorted) how many pairs fulfill the condition. Repeat recursively this operation in right and left subarrays.