In the longest strictly increasing subarray problem, we have an array A, and we need to find the longest subarray such that in that subarray S, S[k]>S[k-1].
Since we can divide the array A into subarrays, how is dynamic programming solution /a/14492948/12862712 useful for this?