Problem 2945 · Hard

Find Maximum Non-decreasing Array Length

Split the array into pieces whose sums never decrease, tracking the last piece in a table to find the most pieces.

Open the interactive visualisation