Given an integer array nums, count how many non-empty contiguous subarrays exist where the first element of each subarray is less than or equal to every other element within that subarray.

Note: A subarray is defined as a contiguous portion of an array.

Constraints:

• $1 \leq$ nums.length $\leq 1000$

• $0 \leq$ nums[i] $\leq 10^5$

The solution efficiently counts all non-empty subarrays where the leftmost element is the smallest ...