给定一个整数数组 nums，找到一个具有最大和的连续子数组（子数组最少包含一个元素），返回其最大和。下面横线处应该填入的是（ ）

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int maxSubArray(vector<int>& nums) {
    int n = nums.size();
    if (n == 0) return 0;

    vector<int> dp(n, 0);
    dp[0] = nums[0];
    int maxSum = dp[0];

    for (int i = 1; i < n; i++) {
        _____________________________________
        maxSum = max(maxSum, dp[i]);
    }

    return maxSum;
}

int main() {
    int n;
    cin >> n;

    vector<int> nums(n);
    for (int i = 0; i < n; i++) {
        cin >> nums[i];
    }

    int result = maxSubArray(nums);
    cout << result << endl;

    return 0;
}

{{ select(1) }}

• dp[i] = max(nums[i+1], dp[i - 1] + nums[i]);
• dp[i] = max(nums[i], dp[i - 1] + nums[i]);
• dp[i] = max(nums[i], dp[i + 1] + nums[i]);
• dp[i] = max(nums[i], dp[i - 1] + nums[i+1]);