7 The maximum sum You are given an integer N and an integer array a of...

Transcribed Image Text:

7 The maximum sum You are given an integer N and an integer array a of N elements. You can decrease the elements of the array multiple times. You have to make the array non-decreasing. In all such possible non-decreasing ordered array, print the sum of elements of that array that have the maximum sum. Note 28 29 29 1. A non-decreasing array is an array in which every element is either equal or greater than the previous element. 2. Consider 1-based indexing. Example 7 The maximum sum You are given an integer N and an integer array a of N elements. You can decrease the elements of the array multiple times. You have to make the array non-decreasing. In all such possible non-decreasing ordered array, print the sum of elements of that array that have the maximum sum. Note 28 29 29 1. A non-decreasing array is an array in which every element is either equal or greater than the previous element. 2. Consider 1-based indexing. Example