You are given a $0$ indexed integer array nums.

In one operation, you can select any contiguous subarray of nums and replace it with a single element equal to the sum of its elements.

Return the maximum possible length of a non decreasing array that can be obtained by applying this operation any number of times.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

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

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.