Find the largest Bitonic sub array in a array

The solution is to run LIS (Longest Increasing Subarray) from left to right and LDS (Longest Decreasing Subarray) from right to left, then sum up for each position and find out the largest value. For detailed solution, take a look at this post.