410. 分割数组的最大值

 410. 分割数组的最大值 - 力扣（LeetCode）

class Solution {
public:
    int splitArray(vector<int>& nums, int k) {
        int n = nums.size();
        vector<int> sum(n + 10);
        for (int i = 0; i < n; i++) sum[i + 1] = sum[i] + nums[i];
        vector<vector<int>> f(n + 10, vector<int>(k + 10, 0x3f3f3f3f));
        f[0][0] = 0;
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= min(i, k); j++) {
                for (int k = 0; k < i; k++) {
                    f[i][j] = min(f[i][j], max(f[k][j - 1], sum[i] - sum[k]));
                }
            }
        }
        return f[n][k];
    }
};