Given an array arr[0...n-1] containing n positive integers, find the length of the longest bitonic subsequence. A subsequence of arr[] is called Bitonic if it is first increasing, then decreasing. Analysis: This problem is a variation of the standard Longest Increasing Subsequence(LIS) probl...
We have to find length of longest bitonic subsequence. As we knot a sequence is said to be bitonic if it's strictly increasing and then strictly decreasing. A strictly increasing sequence is bitonic. Or a strictly decreasing sequence is bitonic also....