title: Divide and Conquer algorithm for Longest Increasing Consecutive sequence in an array
body: <p>Can anyone help me out with this problem that I have been trying to solve for a while.</p>
  
  <p>Lets say there is an array A[1,2...n] of numbers and we wish to find the longest increasing consecutive sub sequence with Divide an Conquer method. Specifically we wish to find indices i,j such that i&lt;=j and A[i]&lt;=A[i+1]&lt;=.....A[j]. For Example if the array has 4,1,3,5,6,7,5,8,2 then it has to return [1,3,5,6,7]. </p>
  
  <p>I have searched a lot about this problem but all I can find is dynamic approach and Longest Increasing Subsequences without consecutive elements.    </p>