2. EV_Positive Prefixes An array of integers, arr[n], can be rearranged arbitrarily. The prefix sum at...

Transcribed Image Text:

2. EV_Positive Prefixes An array of integers, arr[n], can be rearranged arbitrarily. The prefix sum at index iis defined as psum[i] = arr[0] + arr[1] + ... + arr[i]. Rearrange the array to maximize the number of positive elements in the psum array. Report the maximum number of positive elements that can be achieved in the array psum. Note: Here, a positive value is defined as an integer value greater than 0. Example n = 4 arr = [-6, 3, 4, -10] One optimal arrangement is [3, 4, -6, -10]. This has an array of prefix sums psum = [3, 7, 1, -9] with 3 positive elements. 26 2 2 Return 3, the number of positive elements in psum. There is no way to have more than 3 positive elements. Function Description Complete the function maxPosPrefixes in the edit 2. EV_Positive Prefixes An array of integers, arr[n], can be rearranged arbitrarily. The prefix sum at index iis defined as psum[i] = arr[0] + arr[1] + ... + arr[i]. Rearrange the array to maximize the number of positive elements in the psum array. Report the maximum number of positive elements that can be achieved in the array psum. Note: Here, a positive value is defined as an integer value greater than 0. Example n = 4 arr = [-6, 3, 4, -10] One optimal arrangement is [3, 4, -6, -10]. This has an array of prefix sums psum = [3, 7, 1, -9] with 3 positive elements. 26 2 2 Return 3, the number of positive elements in psum. There is no way to have more than 3 positive elements. Function Description Complete the function maxPosPrefixes in the edit

Answer rating: 100% (QA)

Answer include include we will use copy to concatenation of two array using namespace std void fillP... View the full answer