用动态规划算法，JAVA实现：给定n个整数组成的序列，现在要求将序列分割为m段，每段子序列中的数在原序列中连续排序。如何分割才能使这m段子序列的和的最大值达到最小？-Using dynamic programming algorithm, JAVA implementation: the composition of a given sequence of n integers, now requires the sequence is divided into m segments, the