410. 分割数组的最大值

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

记忆化搜索 

class Solution {
public:
    int n;
    vector<int> num;
    vector<vector<int>> memo;
    int dfs(int pos, int k) {
        int sum = 0, ans = 0x3f3f3f3f;
        if (k == 1) {
            if (memo[pos][k] != -1) return memo[pos][k];
            for (int i = pos; i < n; i++) memo[pos][k] += num[i];
            return ++memo[pos][k];
        }
        for (int i = pos; i < n - k + 1; i++) {
            if (memo[i + 1][k - 1] == -1) memo[i + 1][k - 1] = dfs(i + 1, k - 1);
            ans = min(ans, max(sum += num[i], memo[i + 1][k - 1]));
            if (sum > memo[i + 1][k - 1]) return ans;
        }
        return ans;
    }
    int splitArray(vector<int>& nums, int k) {
        n = nums.size(), num = nums;
        memo.resize(n + 10, vector<int>(k + 10, -1));
        return dfs(0, k);
    }
};

动态规划 

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];
    }
};