Longest Non-Decreasing Run — Solution & Editorial

Back to the Problem

Keep the length of the current run; extend it while a_i ≥ a_i-1, otherwise reset to 1.

Complexity: O(N)

Watch out: Non-decreasing allows equal neighbours — use ≥, not >.