Given an array arr[] of size N and an integer X, the task is to find the length of the longest subsequence such that the prefix sum at every element of the subsequence remains greater than zero.
Example:
Input: arr[] = {-2, -1, 1, 2, -2}, N = 5
Output: 3
Explanation: The sequence can be made of elements at index 2, 3 and 4. The prefix sum at every element stays greater than zero: 1, 3, 1Input: arr[] = {-2, 3, 3, -7, -5, 1}, N = 6
Output: 12
Approach: The given problem can be solved using a greedy approach. The idea is to create a min-heap priority queue and traverse the array from the left to right. Add the current element arr[i] to the sum and minheap, and if the sum becomes less than zero, remove the most negative element from the minheap and subtract it from the sum. The below approach can be followed to solve the problem:
- Initialize a min-heap with priority queue data structure
- Initialize a variable sum to calculate the prefix sum of the desired subsequence
- Iterate the array and at every element arr[i] and add the value to the sum and min-heap
- If the value of sum becomes less than zero, remove the most negative element from the min-heap and subtract that value from the sum
- Return the size of the min-heap as the length of the longest subsequence
Below is the implementation of the above approach:
C++
// C++ implementation for the above approach #include <bits/stdc++.h> using namespace std; // Function to calculate longest length // of subsequence such that its prefix sum // at every element stays greater than zero int maxScore( int arr[], int N) { // Variable to store the answer int score = 0; // Min heap implementation // using a priority queue priority_queue< int , vector< int >, greater< int > > pq; // Variable to store the sum int sum = 0; for ( int i = 0; i < N; i++) { // Add the current element // to the sum sum += arr[i]; // Push the element in // the min-heap pq.push(arr[i]); // If the sum becomes less than // zero pop the top element of // the min-heap and subtract it // from the sum if (sum < 0) { int a = pq.top(); sum -= a; pq.pop(); } } // Return the answer return pq.size(); } // Driver Code int main() { int arr[] = { -2, 3, 3, -7, -5, 1 }; int N = sizeof (arr) / sizeof (arr[0]); cout << maxScore(arr, N); return 0; } |
Java
// Java code for the above approach import java.io.*; import java.util.PriorityQueue; class GFG { // Function to calculate longest length // of subsequence such that its prefix sum // at every element stays greater than zero static int maxScore( int arr[], int N) { // Variable to store the answer int score = 0 ; // Min heap implementation // using a priority queue PriorityQueue<Integer> pq = new PriorityQueue<Integer>(); // Variable to store the sum int sum = 0 ; for ( int i = 0 ; i < N; i++) { // Add the current element // to the sum sum += arr[i]; // Push the element in // the min-heap pq.add(arr[i]); // If the sum becomes less than // zero pop the top element of // the min-heap and subtract it // from the sum if (sum < 0 ) { int a = pq.poll(); sum -= a; } } // Return the answer return pq.size(); } // Driver Code public static void main(String[] args) { int arr[] = { - 2 , 3 , 3 , - 7 , - 5 , 1 }; int N = arr.length; System.out.println(maxScore(arr, N)); } } // This code is contributed by Potta Lokesh |
Python3
# Python implementation for the above approach from queue import PriorityQueue # Function to calculate longest length # of subsequence such that its prefix sum # at every element stays greater than zero def maxScore(arr, N): # Variable to store the answer score = 0 ; # Min heap implementation # using a priority queue pq = PriorityQueue(); # Variable to store the sum sum = 0 ; for i in range (N) : # Add the current element # to the sum sum + = arr[i]; # Push the element in # the min-heap pq.put(arr[i]); # If the sum becomes less than # zero pop the top element of # the min-heap and subtract it # from the sum if ( sum < 0 ): a = pq.queue[ 0 ] sum - = a; pq.get() # Return the answer return pq.qsize(); # Driver Code arr = [ - 2 , 3 , 3 , - 7 , - 5 , 1 ]; N = len (arr) print (maxScore(arr, N)) # This code is contributed by saurabh_jaiswal. |
C#
// C# code for the above approach using System; using System.Collections.Generic; public class GFG { // Function to calculate longest length // of subsequence such that its prefix sum // at every element stays greater than zero static int maxScore( int []arr, int N) { // Variable to store the answer int score = 0; // Min heap implementation // using a priority queue List< int > pq = new List< int >(); // Variable to store the sum int sum = 0; for ( int i = 0; i < N; i++) { // Add the current element // to the sum sum += arr[i]; // Push the element in // the min-heap pq.Add(arr[i]); pq.Sort(); // If the sum becomes less than // zero pop the top element of // the min-heap and subtract it // from the sum if (sum < 0) { int a = pq[0]; pq.RemoveAt(0); sum -= a; } } // Return the answer return pq.Count; } // Driver Code public static void Main(String[] args) { int []arr = { -2, 3, 3, -7, -5, 1 }; int N = arr.Length; Console.WriteLine(maxScore(arr, N)); } } // This code contributed by Rajput-Ji |
Javascript
<script> // javascript code for the above approach // Function to calculate longest length // of subsequence such that its prefix sum // at every element stays greater than zero function maxScore(arr , N) { // Variable to store the answer var score = 0; // Min heap implementation // using a priority queue var pq = []; // Variable to store the sum var sum = 0; for (i = 0; i < N; i++) { // Add the current element // to the sum sum += arr[i]; // Push the element in // the min-heap pq.push(arr[i]); // If the sum becomes less than // zero pop the top element of // the min-heap and subtract it // from the sum if (sum < 0) { var a = pq.pop(); sum -= a; } } // Return the answer return pq.length; } // Driver Code var arr = [ -2, 3, 3, -7, -5, 1 ]; var N = arr.length; document.write(maxScore(arr, N)); // This code is contributed by Rajput-Ji </script> |
4
Time Complexity: O(N * log N)
Auxiliary Space: O(N)
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!