1. You are given a number n, representing the number of elements. 2. You are given n numbers, representing the contents of array of length n. 3. You are required to print the sum of elements of the increasing subsequence with maximum sum for the array.
Input Format
A number n .. n more elements
Output Format
A number representing the sum of elements of the increasing subsequence with maximum sum for the array.
Constraints
0 <= n <= 20 0 <= n1, n2, .. <= 100
Notice
Try First, Check Solution later
1. You should first read the question and watch the question video.2. Think of a solution approach, then try and submit the question on editor tab.3. We strongly advise you to watch the solution video for prescribed approach.Example
Input
10 10 22 9 33 21 50 41 60 80 1
Output
255