xxxxxxxxxx
Input:
N = 8
A[] = {15,-2,2,-8,1,7,10,23}
Output: 5
Explanation: The largest subarray with
sum 0 will be -2 2 -8 1 7.
xxxxxxxxxx
// Java program to print largest
// contiguous array sum
class GFG {
static void maxSubArraySum(int a[], int size)
{
int max_so_far = Integer.MIN_VALUE,
max_ending_here = 0,start = 0,
end = 0, s = 0;
for (int i = 0; i < size; i++)
{
max_ending_here += a[i];
if (max_so_far < max_ending_here)
{
max_so_far = max_ending_here;
start = s;
end = i;
}
if (max_ending_here < 0)
{
max_ending_here = 0;
s = i + 1;
}
}
System.out.println("Maximum contiguous sum is "
+ max_so_far);
System.out.println("Starting index " + start);
System.out.println("Ending index " + end);
}
// Driver code
public static void main(String[] args)
{
int a[] = { -2, -3, 4, -1, -2, 1, 5, -3 };
int n = a.length;
maxSubArraySum(a, n);
}
}
// This code is contributed by prerna saini
xxxxxxxxxx
static void update(int arr[], int arrSize, int index, int value)
{
// Your code here
arr[index-1]=value;
}
//Funciton to return the Maximum-Sum in the range.
static int query(int arr[], int n, int left, int right)
{
// code here
int curr=arr[left-1];
int sum=arr[left-1];
for (int i=left;i<right;i++){
sum=Math.max(arr[i], sum+arr[i]);
curr=Math.max(curr,sum);
}
return curr;
}