Editorial

Define dp[i] to be the maximum Cypriot value of the subarray a[i...]. Then, we can apply some choices for the first element. We can either allot a single cut to just this element. It can be merged with its neighbor. If it is merged with its neighbor, then, of course, we want to maximise the Cypriot value of a[i + 1 ...] before doing the merge. This is nothing but dp[i].