689. 三个无重叠子数组的最大和

最新推荐文章于 2024-09-15 11:04:13 发布

zakariyaa33

最新推荐文章于 2024-09-15 11:04:13 发布

阅读量57

点赞数

分类专栏：力扣问题文章标签：滑块算法最大子数组数组处理动态规划算法优化

本文链接：https://blog.csdn.net/qq_34688283/article/details/121785742

版权

力扣问题专栏收录该内容

12 篇文章 0 订阅

订阅专栏

在这里插入图片描述
直接利用三个连在一起的滑块，第一个滑块计算首个最大子数组，第二个滑块计算前一个最大子数组加当前子数组，也就是算两个子数组的最大值，第三个以此类推

vector<int> maxSumOfThreeSubarrays(vector<int>& nums, int k) {
    vector<int> ans;
    int sum1 = 0, maxSum1 = 0, maxSum1Idx = 0;
    int sum2 = 0, maxSum12 = 0, maxSum12Idx1 = 0, maxSum12Idx2 = 0;
    int sum3 = 0, maxTotal = 0;
    for (int i = k * 2; i < nums.size(); ++i) {
        sum1 += nums[i - k * 2];
        sum2 += nums[i - k];
        sum3 += nums[i];
        if (i >= k * 3 - 1) {
            if (sum1 > maxSum1) {
                maxSum1 = sum1;
                maxSum1Idx = i - k * 3 + 1;
            }
            if (maxSum1 + sum2 > maxSum12) {
                maxSum12 = maxSum1 + sum2;
                maxSum12Idx1 = maxSum1Idx;
                maxSum12Idx2 = i - k * 2 + 1;
            }
            if (maxSum12 + sum3 > maxTotal) {
                maxTotal = maxSum12 + sum3;
                ans = { maxSum12Idx1, maxSum12Idx2, i - k + 1 };
            }
            sum1 -= nums[i - k * 3 + 1];
            sum2 -= nums[i - k * 2 + 1];
            sum3 -= nums[i - k + 1];
        }
    }
    return ans;
}