You are given a one dimensional array that may contain both positive and negative integers, find the sum of contiguous subarray of numbers which has the largest sum. For example, if the given array is...

Output Format i ‘m utput a single integer denoting


Extracted text: You are given a one dimensional array that may contain both positive and negative integers, find the sum of contiguous subarray of numbers which has the largest sum. For example, if the given array is (-2, -5, 6, -2, -3, 1, 5, -6}, then the maximum subarray sum is 7. Input Format The first line of contains a single integer N denoting the number of elements for the array A. The second line contains N space separated integers denoting the elements of the array. Output Format Output a single integer denoting the maximum subarray sum in C++.