You are given an integer array nums.

In one operation, you can select any contiguous subarray of nums and replace it with its maximum element.

Return the maximum possible length of an array sorted in non decreasing order that can be obtained by performing this operation any number of times.

Constraints:

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

• $1 \leq$ nums[i] $\leq 2 imes 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.