Challenge Information

Title : Increasing Subsequence Sum
Difficulty : Medium
Solutions : 9
Maximum Score : 100
Completed by You: No
Description :

There is an array of positive integers given. You have to find the maximum sum increasing subsequence of the given array.

Write a function solve that have the following parameter(s):
1.) arr = an array of integer

Example
Input:
arr = [2,4,1,6]
Output:
12

Explanation
The maximum sum of an increasing sequence obtained is {2,4,6}.

Constraints

Judocode