最大子列和问题

 

 

 

 

#include <iostream>

using namespace std;

int MaxSubSum(int a[], int N)
{
    int ThisSum = 0, MaxSum = 0;
    for(int i = 0; i < N; ++i)
    {
        ThisSum += a[i];       //向右累加
        if(ThisSum > MaxSum)
            MaxSum = ThisSum;  //发现更大和则更新当前结果
        else if(ThisSum < 0)   //若果当前子列和为负
            ThisSum = 0;
    }
    return MaxSum;
}

int main()
{
    int K;
    cin >> K;
    const int N = K;
    int a[N];
    for(int i = 0; i < N; ++i)
        cin >> a[i];
    cout << MaxSubSum(a, N);

    return 0;
}