Longest Non-Decreasing Run

Difficulty: 1000 2000 ms 128 MB

implementation

Find the length of the longest contiguous run of non-decreasing values (each element ≥ the previous one).

Input: the first line has an integer N; the second line has N integers separated by spaces.

Output: one integer — the length of the longest such run.

Constraints:

• 1 ≤ N ≤ 2000
• −10⁹ ≤ a_i ≤ 10⁹

Sample Tests

7
2 2 5 3 4 4 1

3

1
9

1

Read the Editorial