让数组
A[0] = 2
A[1] = 1
A[2] = 5
A[3] = 1
A[4] = 2
A[5] = 2
A[6] = 2
我需要将数组分成K个部分,使得较大的总和最小。
例如,当k=3时。
[2, 1, 5, 1, 2, 2, 2], [], [] with a large sum of 15;
[2], [1, 5, 1, 2], [2, 2] with a large sum of 9;
[2, 1, 5], [], [1, 2, 2, 2] with a large sum of 8;
[2, 1], [5, 1], [2, 2, 2] with a large sum of 6.
所以算法应该返回6。
我应该使用哪个算法,这是修改过的KMP算法吗?
请提供一种方法。