I just solved that problem in O($$$N^2$$$) with dynamic programming. I can send you the code if you want. Now trying to solve it for other subtasks.

it is easy to see that the more blocks the less their greatest amount. this means that it is beneficial for us to minimize the amount of the next block. so using this property we can make easy dp. code : https://pastebin.com/7shatgaU