Geeksforgeeks

X

DAYS

:

HOUR

:

MINS

:

SEC

Error

Copied to Clipboard

Given an array **arr** of **N** positive integers, the task is to find the **maximum sum increasing subsequence** of the given array.

**Example 1:**

**Input**: N = 5, arr[] = {1, 101, 2, 3, 100}
**Output:** 106
**Explanation**:The maximum sum of a
increasing sequence is obtained from
{1, 2, 3, 100}

**Example 2:**

**Input**: N = 3, arr[] = {1, 2, 3}
**Output:** 6
**Explanation**:The maximum sum of a
increasing sequence is obtained from
{1, 2, 3}

**Your Task: **

You don't need to read input or print anything. Complete the function ** maxSumIS() **which takes

**Expected Time Complexity:** O(**N ^{2}**)

**Constraints:**

1 ≤ N ≤ 10^{3}

1 ≤ arr[i] ≤ 10^{5}

We are replacing the old Disqus forum with the new Discussions section given below.

Click here to view old Disqus comments.

Click here to view old Disqus comments.

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

YesLoading...

Maximum sum increasing subsequence

...