Count the Number of Incremovable Subarrays I
You are given a 0-indexed array of positive integers nums.
A subarray of nums is called incremovable if nums becomes strictly increasing after removing the subarray.
Return the total number of incremovable subarrays of nums.
Note that an empty array is considered strictly increasing.
A subarray is a contiguous non-empty sequence of elements within an array.
Example 1
Input
nums = [1,2,3,4]Output
10The 10 incremovable subarrays are [1], [2], [3], [4], [1,2], [2,3], [3,4], [1,2,3], [2,3,4], and [1,2,3,4], because removing any one of these subarrays makes
nums strictly increasing.Example 2
Input
nums = [6,5,7,8]Output
7There are exactly 7 incremovable subarrays: [5], [6], [5,7], [6,5], [5,7,8], [6,5,7], and [6,5,7,8].
Constraints
- 1 <= nums.length <= 50
- 1 <= nums[i] <= 50