最大子序和(动态规划)

#include <bits/stdc++.h>

using namespace std;

int maxSubArray(deque<int> &nums) {
    if (nums.empty())
        return 0;
    //result1存储之前数的和(不包括当前遍历的数)
    int result1 = nums[0], result2, res = result1;
    for (int i = 1; i < nums.size(); i++)
        result2 = max(nums[i], nums[i] + result1), result1 = result2, res = max(res, result1);
    return res;
}

int main() {
    //输入: [-2,1,-3,4,-1,2,1,-5,4]
    //输出: 6
    //解释: 连续子数组 [4,-1,2,1] 的和最大，为 6
    deque<int> d;
    int num;
    while(scanf("%d",&num),num)
        d.emplace_back(num);
    printf("%d\n", maxSubArray(d));
    return 0;
}