Minimum Partition Score
Split a list into exactly k contiguous blocks; each block costs a triangular number of its sum, so a layered table over prefixes finds the cheapest split.
Split a list into exactly k contiguous blocks; each block costs a triangular number of its sum, so a layered table over prefixes finds the cheapest split.