C++ Program to Find the K-th Largest Sum Contiguous Subarray
Last Updated :
13 Jan, 2022
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 3rd largest sum is 14.
Input: a[] = {10, -10, 20, -40}
k = 6
Output: -10
Explanation: The 6th largest sum among
sum of all contiguous subarrays is -10.
A brute force approach is to store all the contiguous sums in another array and sort it and print the k-th largest. But in the case of the number of elements being large, the array in which we store the contiguous sums will run out of memory as the number of contiguous subarrays will be large (quadratic order)
An efficient approach is to store the pre-sum of the array in a sum[] array. We can find sum of contiguous subarray from index i to j as sum[j]-sum[i-1]Â
Now for storing the Kth largest sum, use a min heap (priority queue) in which we push the contiguous sums till we get K elements, once we have our K elements, check if the element is greater than the Kth element it is inserted to the min heap with popping out the top element in the min-heap, else not inserted. In the end, the top element in the min-heap will be your answer.
Below is the implementation of the above approach. Â
C++
#include <bits/stdc++.h>
using namespace std;
int kthLargestSum( int arr[], int n, int k)
{
int sum[n + 1];
sum[0] = 0;
sum[1] = arr[0];
for ( int i = 2; i <= n; i++)
sum[i] = sum[i - 1] + arr[i - 1];
priority_queue< int , vector< int >, greater< int > > Q;
for ( int i = 1; i <= n; i++)
{
for ( int j = i; j <= n; j++)
{
int x = sum[j] - sum[i - 1];
if (Q.size() < k)
Q.push(x);
else
{
if (Q.top() < x)
{
Q.pop();
Q.push(x);
}
}
}
}
return Q.top();
}
int main()
{
int a[] = { 10, -10, 20, -40 };
int n = sizeof (a) / sizeof (a[0]);
int k = 6;
cout << kthLargestSum(a, n, k);
return 0;
}
|
Output:
-10
Time complexity: O(n^2 log (k))Â
Auxiliary Space : O(k) for min-heap and we can store the sum array in the array itself as it is of no use.
Please refer complete article on K-th Largest Sum Contiguous Subarray for more details!
Share your thoughts in the comments
Please Login to comment...