Geeksforgeeks

Error

×

Leaderboard

Showing:

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

@Ibrahim Nash | 6560 |

@blackshadows | 6400 |

@mb1973 | 5777 |

@Quandray | 5271 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 5074 |

@kirtidee18 | 4356 |

@sanjay05 | 3762 |

@mantu_singh | 3638 |

@gfgaccount | 3601 |

@marius_valentin_dragoi | 3525 |

Complete Leaderboard | |

Handle | Score |

@anish5256 | 991 |

@vimleshpratapsingh321 | 980 |

@skj7 | 871 |

@akhileshkumar562002 | 862 |

@pradeeppatidar1999 | 840 |

@kanewilliamson123 | 837 |

@pd420786 | 813 |

@infilooop | 800 |

@bunnybug320 | 796 |

@smitabose7826 | 784 |

@virgat | 768 |

Complete Leaderboard |

Given an array arr[] of N integers. A subsequence of arr[] is called Bitonic if it is first increasing then decreasing. Print the max sum bitonic subsequence.

**Example 1:**

**Input :**
N = 9
arr[] = {1, 15, 51, 45, 33,
100, 12, 18, 9}
**Output : **194
**Explanation :**
Bi-tonic Sub-sequence are :
{1, 51, 9} or {1, 50, 100, 18, 9} or
{1, 15, 51, 100, 18, 9} or
{1, 15, 45, 100, 12, 9} or
{1, 15, 45, 100, 18, 9} .. so on
Maximum sum Bi-tonic sub-sequence is 1 +
15 + 51 + 100 + 18 + 9 = 194

**Example 2:**

**Input :**
N = 6
arr[] = {80, 60, 30, 40, 20, 10}
**Output :**
210
**Explanation :**
Here the sequence is strinctly decreasing.

**Your Task: **

You don't need to read input or print anything. Your task is to complete the function **leftIndex()** which takes the array **arr[]** and its size **N **as inputs and returns the maximum Bitonic sequence sum.

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

**Expected Auxiliary Space:** O(N)

**Constraints:**

1<=N<=10^{3}

1<=arr[]<=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?

YesLoading...

Maximum Sum Bitonic Subsequence

...