Leetcode 2970. Count the Number of Incremovable Subarrays I

Count the number of contiguous non-empty subarrays whose removal makes the remaining array strictly increasing (the empty array counts as strictly increasing). The core challenge is to evaluate splits where the left and right parts are each strictly increasing and the boundary elements (if any) maintain a strict increasing order.