Java Program for Maximum equilibrium sum in an array
Last Updated :
31 Jan, 2022
Given an array arr[]. Find the maximum value of prefix sum which is also suffix sum for index i in arr[].
Examples :
Input : arr[] = {-1, 2, 3, 0, 3, 2, -1}
Output : 4
Prefix sum of arr[0..3] =
Suffix sum of arr[3..6]
Input : arr[] = {-2, 5, 3, 1, 2, 6, -4, 2}
Output : 7
Prefix sum of arr[0..3] =
Suffix sum of arr[3..7]
A Simple Solution is to one by one check the given condition (prefix sum equal to suffix sum) for every element and returns the element that satisfies the given condition with maximum value.
Java
// java program to find maximum
// equilibrium sum.
import java.io.*;
class GFG {
// Function to find maximum
// equilibrium sum.
static int findMaxSum(int []arr, int n)
{
int res = Integer.MIN_VALUE;
for (int i = 0; i < n; i++)
{
int prefix_sum = arr[i];
for (int j = 0; j < i; j++)
prefix_sum += arr[j];
int suffix_sum = arr[i];
for (int j = n - 1; j > i; j--)
suffix_sum += arr[j];
if (prefix_sum == suffix_sum)
res = Math.max(res, prefix_sum);
}
return res;
}
// Driver Code
public static void main (String[] args)
{
int arr[] = {-2, 5, 3, 1, 2, 6, -4, 2 };
int n = arr.length;
System.out.println(findMaxSum(arr, n));
}
}
// This code is contributed by anuj_67.
Time Complexity: O(n2)
Auxiliary Space: O(n)
A Better Approach is to traverse the array and store prefix sum for each index in array presum[], in which presum[i] stores sum of subarray arr[0..i]. Do another traversal of the array and store suffix sum in another array suffsum[], in which suffsum[i] stores sum of subarray arr[i..n-1]. After this for each index check if presum[i] is equal to suffsum[i] and if they are equal then compare their value with the overall maximum so far.
Java
// Java program to find maximum equilibrium sum.
import java.io.*;
public class GFG {
// Function to find maximum
// equilibrium sum.
static int findMaxSum(int []arr, int n)
{
// Array to store prefix sum.
int []preSum = new int[n];
// Array to store suffix sum.
int []suffSum = new int[n];
// Variable to store maximum sum.
int ans = Integer.MIN_VALUE;
// Calculate prefix sum.
preSum[0] = arr[0];
for (int i = 1; i < n; i++)
preSum[i] = preSum[i - 1] + arr[i];
// Calculate suffix sum and compare
// it with prefix sum. Update ans
// accordingly.
suffSum[n - 1] = arr[n - 1];
if (preSum[n - 1] == suffSum[n - 1])
ans = Math.max(ans, preSum[n - 1]);
for (int i = n - 2; i >= 0; i--)
{
suffSum[i] = suffSum[i + 1] + arr[i];
if (suffSum[i] == preSum[i])
ans = Math.max(ans, preSum[i]);
}
return ans;
}
// Driver Code
static public void main (String[] args)
{
int []arr = { -2, 5, 3, 1, 2, 6, -4, 2 };
int n = arr.length;
System.out.println( findMaxSum(arr, n));
}
}
// This code is contributed by anuj_67
Time Complexity: O(n)
Auxiliary Space: O(n)
Further Optimization :
We can avoid the use of extra space by first computing the total sum, then using it to find the current prefix and suffix sums.
Java
// Java program to find maximum equilibrium
// sum.
import java.lang.Math.*;
import java.util.stream.*;
class GFG {
// Function to find maximum equilibrium
// sum.
static int findMaxSum(int arr[], int n)
{
int sum = IntStream.of(arr).sum();
int prefix_sum = 0,
res = Integer.MIN_VALUE;
for (int i = 0; i < n; i++)
{
prefix_sum += arr[i];
if (prefix_sum == sum)
res = Math.max(res, prefix_sum);
sum -= arr[i];
}
return res;
}
// Driver Code
public static void main(String[] args)
{
int arr[] = { -2, 5, 3, 1,
2, 6, -4, 2 };
int n = arr.length;
System.out.print(findMaxSum(arr, n));
}
}
// This code is contributed by Smitha.
Time Complexity: O(n)
Auxiliary Space: O(1)
Please refer complete article on Maximum equilibrium sum in an array for more details!
Similar Reads
Java Program for Equilibrium index of an array Equilibrium index of an array is an index such that the sum of elements at lower indexes is equal to the sum of elements at higher indexes. For example, in an array A: Example : Input: A[] = {-7, 1, 5, 2, -4, 3, 0} Output: 3 3 is an equilibrium index, because: A[0] + A[1] + A[2] = A[4] + A[5] + A[6]
5 min read
Java Program to Minimize the Maximum Element of an Array Given two integers N and K. Create an array of N positive integers such that the sum of all elements of the array is divisible by K and the maximum element in the array is the minimum possible. You have to find the Maximum element of that array. Example: Input : N=5, K=11 Output : 3 Explanation : We
4 min read
Java Program for Maximum sum of i*arr[i] among all rotations of a given array Given an array arr[] of n integers, find the maximum that maximizes the sum of the value of i*arr[i] where i varies from 0 to n-1. Examples: Input: arr[] = {8, 3, 1, 2} Output: 29 Explanation: Lets look at all the rotations, {8, 3, 1, 2} = 8*0 + 3*1 + 1*2 + 2*3 = 11 {3, 1, 2, 8} = 3*0 + 1*1 + 2*2 +
6 min read
Java Program for Maximum difference between groups of size two Given an array of even number of elements, form groups of 2 using these array elements such that the difference between the group with highest sum and the one with lowest sum is maximum.Note: An element can be a part of one group only and it has to be a part of at least 1 group. Examples: Input : ar
3 min read
Maximum sum by picking elements from two arrays in order Given two arrays of size N and two integers X and Y indicating the maximum number of elements, one can pick from array A and array B respectively. At each ith turn, either A[i] or B[i] can be picked. The task is to make the selection that results in the maximum possible sum. Note: It is guaranteed t
14 min read
Java Program for Number of pairs with maximum sum Write a java program for a given array arr[], count number of pairs arr[i], arr[j] such that arr[i] + arr[j] is maximum and i < j.Example: Input : arr[] = {1, 1, 1, 2, 2, 2}Output: 3Explanation: The maximum possible pair sum where i<j is 4, which is given by 3 pairs, so the answer is 3 the pai
4 min read
Java Program for Queries to find maximum sum contiguous subarrays of given length in a rotating array Given an array arr[] of N integers and Q queries of the form {X, Y} of the following two types: If X = 1, rotate the given array to the left by Y positions.If X = 2, print the maximum sum subarray of length Y in the current state of the array. Examples:Â Input: N = 5, arr[] = {1, 2, 3, 4, 5}, Q = 2,
5 min read
Java Program to Find the K-th Largest Sum Contiguous Subarray Given an array of integers. Write a program to find the K-th largest sum of contiguous subarray within the array of numbers which has negative and positive numbers. Examples: Input: a[] = {20, -5, -1} k = 3 Output: 14 Explanation: All sum of contiguous subarrays are (20, 15, 14, -5, -6, -1) so the 3
3 min read
Javascript Program for Maximum equilibrium sum in an array Given an array arr[]. Find the maximum value of prefix sum which is also suffix sum for index i in arr[].Examples : Input : arr[] = {-1, 2, 3, 0, 3, 2, -1}Output : 4Prefix sum of arr[0..3] = Suffix sum of arr[3..6]Input : arr[] = {-2, 5, 3, 1, 2, 6, -4, 2}Output : 7Prefix sum of arr[0..3] = Suffix s
3 min read
PHP Program for Maximum Equilibrium Sum in an Array Given an array arr[]. Find the maximum value of prefix sum which is also suffix sum for index i in arr[].Examples: Input : arr[] = {-1, 2, 3, 0, 3, 2, -1}Output : 4Prefix sum of arr[0..3] = Suffix sum of arr[3..6]Input : arr[] = {-2, 5, 3, 1, 2, 6, -4, 2}Output : 7Prefix sum of arr[0..3] = Suffix su
3 min read