class Solution {

 public:

     int maxSubArray(int A[], int n) {

         // IMPORTANT: Please reset any member data you declared, as

         // the same Solution instance will be reused for each test case.

         if(n==) return ;

         return maxSubArrayHelperFunction(A,,n-);

     }

     int maxSubArrayHelperFunction(int A[], int left, int right) {

         if(right == left) return A[left];

         int middle = (left+right)/;

         int leftans = maxSubArrayHelperFunction(A, left, middle);

         int rightans = maxSubArrayHelperFunction(A, middle+, right);

         int leftmax = A[middle];

         int rightmax = A[middle+];

         int temp = ;

         for(int i=middle;i>=left;i--) {

             temp += A[i];

             if(temp > leftmax) leftmax = temp;

         }

         temp = ;

         for(int i=middle+;i<=right;i++) {

             temp += A[i];

             if(temp > rightmax) rightmax = temp;

         }

         return max(max(leftans, rightans),leftmax+rightmax);

     }

 };