Maximum Sum Bitonic Subsequence
Easy Accuracy: 60.24% Submissions: 801 Points: 2

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(N2)
Expected Auxiliary Space: O(N)

Constraints:
1<=N<=103
1<=arr[]<=105

We are replacing the old Disqus forum with the new Discussions section given below.
Click here to view old Disqus comments.


to report an issue on this page.

Editorial

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

Yes

All Submissions

My Submissions:

Login to access your submissions.

Maximum Sum Bitonic Subsequence

Output Window