题解 | #连续最大和#

#include <iostream>
#include<vector>
using namespace std;
int main()
{
    int n = 0;
    int maxsum = 0, maxs = 0;
    cin >> n;
    vector<int> nums(n);

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

    maxsum=nums[0];
    for (int i = 0; i < n; i++)
    {
        maxs += nums[i];
        if (maxsum < maxs)
        {
            maxsum = maxs;
        }

        if (maxs < 0)
        {
            maxs = 0;
        }
    }

    cout << maxsum << endl;
    return 0;
}