Maximum Length Bitonic

#1

could you please explain the question and help me in approaching this question, thnku

#2

For 1st sample case the bitonic sequence is 1 2 4 5 2 1
For 2nd sample case the sequence is 80 60 40 20 10

This problem is a variation of standard Longest Increasing Subsequence (LIS) problem. Let the input array be arr[] of length n. We need to construct two arrays lis[] and lds[] using Dynamic Programming solution of LIS problem. lis[i] stores the length of the Longest Increasing subsequence ending with arr[i]. lds[i] stores the length of the longest Decreasing subsequence starting from arr[i]. Finally, we need to return the max value of lis[i] + lds[i] – 1 where i is from 0 to n-1.