Bitonic sequence problem

#1

Is the bitonic sequence problem is a dp problem ? if yes then why?

#2

Yes it is a dp problem , it is actually quite similar to longest increasing subsequence.
Here, we calaculate lis(longest increasing subsequence) and lds(longest increasing subsequence) and for every index we calculate longest increasing subsequence ending at that index and every index uses the result of previous indexes