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