[LeetCode OJ]Split Array Largest Sum

【问题描述】

Given an array which consists of non-negative integers and an integer m, you can split the array into m non-empty continuous subarrays. Write an algorithm to minimize the largest sum among these m subarrays.

Note:
If n is the length of array, assume the following constraints are satisfied:

• 1 ≤ n ≤ 1000
• 1 ≤ m ≤ min(50, n)

Examples:

Input:
nums = [7,2,5,10,8]
m = 2

Output:
18

Explanation:
There are four ways to split nums into two subarrays.
The best way is to split it into [7,2,5] and [10,8],
where the largest sum among the two subarrays is only 18.

问题来源：split-array-largest-sum

【解题分析】

建立一个二维数组result，假设result[i][j]表示将前j个数字分割成i组所能得到的最小的各个连续子数组中的最大值，整个数组初始化为整形最大值，如果无法分i组，则保持整形最大值。

假设一个在第i-1个数到第j个数之间的第k个数，其中sum[i]是前i个数的和： 

  最终返回result[m][n]，即是最终结果。

  时间复杂度O(N^3)，空间复杂度O(N^2)。

【源代码】

class Solution {
public:
    int splitArray(vector<int>& nums, int m) {
    	int n = nums.size();
        vector<int> sums(n+1, 0);
        vector<vector<int> > result(m+1, vector<int>(n+1, INT_MAX));
        result[0][0] = 0;
        for (int i = 0; i < n; i++) {
        	sums[i+1] = sums[i] + nums[i]; 
        }
        for (int i = 1; i <= m; i++) {
        	for (int j = 1; j <= n; j++) {
        		for (int k = i - 1; k < j; k++) {
        			int value = max(result[i-1][k], sums[j]- sums[k]);
        			result[i][j] = min(result[i][j], value);
        		}
        	}
        }
        return result[m][n];
    }
};