题解 | #连续子数组的最大和#

class Solution {
public:
    int FindGreatestSumOfSubArray(vector<int> array) {
        int res=0xc0c0c0c0,ma=res;
        for(auto x:array)res=max(x,res+x),ma=max(ma,res);
        return ma;
    }
};