Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 6420 |

@blackshadows | 6376 |

@mb1973 | 5594 |

@Quandray | 5231 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 4510 |

@sanjay05 | 3762 |

@kirtidee18 | 3673 |

@marius_valentin_dragoi | 3522 |

@sushant_a | 3459 |

@verma_ji | 3412 |

Complete Leaderboard | |

Handle | Score |

@codersgroup18 | 783 |

@Manikanta punnam | 605 |

@sriramgoparaju99 | 594 |

@rdakka | 538 |

@praveenbgp6 | 529 |

@prankursharma31 | 518 |

@yashkaril4 | 517 |

@purohitmn02 | 467 |

@sonamnigam1999 | 443 |

@sonamkumari63928 | 441 |

@shubhamstudent5 | 433 |

Complete Leaderboard |

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}

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?

Yes
Maximum sum increasing subsequence

...