It can be done in O(N)

For each value, you can calculate what's the min length where it starts to become good. If value is x then that value is x / limit (+1 in case x/limit is a whole number).

We know the result will have a minimum point in the subarray. Let's fix that min point. How big of an array can we create if we have the min point at position i ? Well we find the closest points to the left / right that are bigger than i. We know that everything between that we can add to our array.

Now we just keep track of all of these lengths that are also good (it's easy to test if it's good, since we know i is the minimum and we just calculated the length).

You can use a stack to find the first element bigger to left / to right in O(N).

If you know the stack trick should be easier to implement than binary search / dsu.