class Solution {
public:
int FindGreatestSumOfSubArray(vector<int> array) {
int length = array.size();
if(length < 0)
return 0;
int sum = array[0], max = array[0];
for(int i = 1; i < length; i++) {
if(sum < 0)
sum = 0;
sum += array[i];
if(sum > max)
max = sum;
}
return max;
}
};