Remember to use this editorial only when stuck, and not to copy-paste code from it. Please be respectful to the problem author and editorialist.
Submitting an official solution before solving the problem yourself is a bannable offence.

Author: dora

区间型动态规划题目
时间复杂度\(O(n^3)\), 所以\(n\)的最大值为\(10^3\)


Comments

There are no comments at the moment.