Given an Array of Positive and Negative Integers, find out the Maximum Subarray Sum in that Array.
Examples:
Input1 : arr = {-2, -3, 4, -1, -2, 1, 5, -3}
Output1 : 7
Input2 : arr = {4, -8, 9, -4, 1, -8, -1, 6}
Output2 : 9
Kadane’s Algorithm solves this problem using Dynamic Programming approach in linear time. Here is another approach using Dynamic Programming and Prefix Sum to find out maximum subarray sum in Linear time.
Prerequisite: Prefix Sum Array
1. First calculate the prefix sum (prefix_sum) of the input array.
2. Sum of a subarray from index x to y can be presented as,
3. Now maximum of these subarrays is,
That is, we keep track of minimum prefix sum for x <= y and maximum subarray sum so far.
![$$\sum\limits_{ele=x}^{y} arr[ele] = prefix\_sum[y] - prefix\_sum[x-1] $$](https://web.archive.org/web/20200919162513im_/https://www.geeksforgeeks.org/wp-content/ql-cache/quicklatex.com-47fa6d61de67d74969b392987830d4ef_l3.png "Rendered by QuickLaTeX.com")
![$$max(\sum\limits_{ele=x}^{y} arr[ele]) = max(prefix\_sum[y] - prefix\_sum[x-1]) =$$ $$max_{1<=y<=n}(prefix\_sum[y] - min_{x<=y}(prefix\_sum[x-1])) $$](https://web.archive.org/web/20200919162513im_/https://www.geeksforgeeks.org/wp-content/ql-cache/quicklatex.com-76c001d2522a5e97c8c41f7863238868_l3.png "Rendered by QuickLaTeX.com")
Implementation:
1. Calculate the prefix sum of the input array.
2. Initialize : min_prefix_sum = 0, res = -infinite
3. Maintain a loop for i = 0 to n. (n is the size of the input array).
a) cand = prefix_sum[i] – mini
b) If cand is greater than res (maximum subarray sum so far), then update res by cand.
c) If prefix_sum[i] is less than min_prefix_sum (minimum prefix sum so far), then update min_prefix_sum by prefix_sum[i].
4. Return res.
C++
// C++ program to find out maximum subarray // sum in linear time using prefix sum. #include <iostream> #include <limits> using namespace std; // Function to compute maximum subarray // sum in linear time. int maximumSumSubarray(int arr[], int n) { // Initialize minimum prefix sum to 0. int min_prefix_sum = 0; // Initialize maximum subarray sum so // far to -infinity. int res = numeric_limits<int>::min(); // Initialize and compute the prefix // sum array. int prefix_sum[n]; prefix_sum[0] = arr[0]; for (int i = 1; i < n; i++) prefix_sum[i] = prefix_sum[i - 1] + arr[i]; // loop through the array, keep track // of minimum prefix sum so far and // maximum subarray sum. for (int i = 0; i < n; i++) { res = max(res, prefix_sum[i] - min_prefix_sum); min_prefix_sum = min(min_prefix_sum, prefix_sum[i]); } return res; } // Driver Program int main() { // Test case 1 int arr1[] = { -2, -3, 4, -1, -2, 1, 5, -3 }; int n1 = sizeof(arr1) / sizeof(arr1[0]); cout << maximumSumSubarray(arr1, n1) << endl; // Test case 2 int arr2[] = { 4, -8, 9, -4, 1, -8, -1, 6 }; int n2 = sizeof(arr2) / sizeof(arr2[0]); cout << maximumSumSubarray(arr2, n2); return 0; } |
Java
// Java program to find // out maximum subarray // sum in linear time // using prefix sum. class GFG { // Function to compute maximum // subarray sum in linear time. static int maximumSumSubarray(int arr[], int n) { // Initialize minimum // prefix sum to 0. int min_prefix_sum = 0; // Initialize maximum subarray // sum so far to -infinity. int res = Integer.MIN_VALUE; // Initialize and compute // the prefix sum array. int prefix_sum[] = new int[n]; prefix_sum[0] = arr[0]; for (int i = 1; i < n; i++) prefix_sum[i] = prefix_sum[i - 1] + arr[i]; // loop through the array, keep // track of minimum prefix sum so // far and maximum subarray sum. for (int i = 0; i < n; i++) { res = Math.max(res, prefix_sum[i] - min_prefix_sum); min_prefix_sum = Math.min(min_prefix_sum, prefix_sum[i]); } return res; } // Driver Program public static void main (String[] args) { // Test case 1 int arr1[] = { -2, -3, 4, -1, -2, 1, 5, -3 }; int n1 = arr1.length; System.out.println(maximumSumSubarray(arr1, n1)); // Test case 2 int arr2[] = { 4, -8, 9, -4, 1, -8, -1, 6 }; int n2 = arr2.length; System.out.println(maximumSumSubarray(arr2, n2)); } } // This code is contributed by Ansu Kumari. |
Python3
# Python3 program to find out # maximum subarray sum in # linear time using prefix # sum. import math # Function to compute maximum # subarray sum in linear time. def maximumSumSubarray(arr, n): # Initialize minimum prefix # sum to 0. min_prefix_sum = 0 # Initialize maximum subarray # sum so far to -infinity. res = -math.inf # Initialize and compute the # prefix sum array. prefix_sum = [] prefix_sum.append(arr[0]) for i in range(1, n): prefix_sum.append(prefix_sum[i - 1] + arr[i]) # loop through the array keep # track of minimum prefix sum # so far and maximum subarray # sum. for i in range(n): res = max(res, prefix_sum[i] - min_prefix_sum) min_prefix_sum = min(min_prefix_sum, prefix_sum[i]) return res # Driver Program # Test case 1 arr1 = [ -2, -3, 4, -1, -2, 1, 5, -3 ] n1 = len(arr1) print(maximumSumSubarray(arr1, n1)) # Test case 2 arr2 = [ 4, -8, 9, -4, 1, -8, -1, 6 ] n2 = len(arr2) print(maximumSumSubarray(arr2, n2)) # This code is contributed by Ansu Kuamri. |
C#
// C# program to find // out maximum subarray // sum in linear time // using prefix sum. using System; class GFG { // Function to compute maximum // subarray sum in linear time. static int maximumSumSubarray(int []arr, int n) { // Initialize minimum // prefix sum to 0. int min_prefix_sum = 0; // Initialize maximum subarray // sum so far to -infinity. int res = int.MinValue; // Initialize and compute // the prefix sum array. int []prefix_sum = new int[n]; prefix_sum[0] = arr[0]; for (int i = 1; i < n; i++) prefix_sum[i] = prefix_sum[i - 1] + arr[i]; // loop through the array, keep // track of minimum prefix sum so // far and maximum subarray sum. for (int i = 0; i < n; i++) { res = Math.Max(res, prefix_sum[i] - min_prefix_sum); min_prefix_sum = Math.Min(min_prefix_sum, prefix_sum[i]); } return res; } // Driver Program public static void Main () { // Test case 1 int []arr1 = { -2, -3, 4, -1, -2, 1, 5, -3 }; int n1 = arr1.Length; Console.WriteLine(maximumSumSubarray(arr1, n1)); // Test case 2 int []arr2 = { 4, -8, 9, -4, 1, -8, -1, 6 }; int n2 = arr2.Length; Console.WriteLine(maximumSumSubarray(arr2, n2)); } } // This code is contributed by vt_m. |
PHP
<?php // PHP program to find out // maximum subarray sum in // linear time using prefix sum. // Function to compute maximum // subarray sum in linear time. function maximumSumSubarray($arr, $n) { // Initialize minimum // prefix sum to 0. $min_prefix_sum = 0; // Initialize maximum subarray // sum so far to -infinity. $res = PHP_INT_MIN; // Initialize and compute // the prefix sum array. $prefix_sum = array(); $prefix_sum[0] = $arr[0]; for ($i = 1; $i < $n; $i++) $prefix_sum[$i] = $prefix_sum[$i - 1] + $arr[$i]; // loop through the array, // keep track of minimum // prefix sum so far and // maximum subarray sum. for ($i = 0; $i < $n; $i++) { $res = max($res, $prefix_sum[$i] - $min_prefix_sum); $min_prefix_sum = min($min_prefix_sum, $prefix_sum[$i]); } return $res; } // Driver Code // Test case 1 $arr1 = array(-2, -3, 4, -1, -2, 1, 5, -3); $n1 = count($arr1); echo maximumSumSubarray($arr1, $n1), " \n" ; // Test case 2 $arr2 = array(4, -8, 9, -4, 1, -8, -1, 6); $n2 = count($arr2); echo maximumSumSubarray($arr2, $n2); // This code is contributed by anuj_67. ?> |
Output :
7 9
Simpler and Efficient Solution
Time Complexity: O(n). It takes linear time to compute the prefix sum and takes constant time in each iteration of the for loop. Hence overall complexity is O(n).
Please note that the above problem can be solved in O(n) time and O(1) extra space using Kadane’s algorithm
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
Recommended Posts:
- Maximum sum increasing subsequence from a prefix and a given element after prefix is must
- First subarray having sum at least half the maximum sum of any subarray of size K
- Maximum length of subarray such that sum of the subarray is even
- Python | Prefix Sum Subarray till False value
- Maximum sum subarray having sum less than or equal to given sum using Set
- Maximum length of subarray such that all elements are equal in the subarray
- Maximum array sum with prefix and suffix multiplications with -1 allowed
- Maximize the subarray sum after multiplying all elements of any subarray with X
- Count of subarray that does not contain any subarray with sum 0
- Maximum sum subarray having sum less than or equal to given sum
- Maximum Subarray Sum using Divide and Conquer algorithm
- Maximum Sum SubArray using Divide and Conquer | Set 2
- First element greater than or equal to X in prefix sum of N numbers using Binary Lifting
- Queries to find the Lower Bound of K from Prefix Sum Array with updates using Fenwick Tree
- Count of occurrences of each prefix in a string using modified KMP algorithm
- Maximum circular subarray sum
- Find Maximum Sum Strictly Increasing Subarray
- Maximum sum subarray removing at most one element
- Maximum subarray sum modulo m
- Find maximum (or minimum) sum of a subarray of size k
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
