<p><img alt="The longest increasing subsequence problem can be formulated as follows: input: n, a positive integer, and the array A of n c" src="https://media.cheggcdn.com/media%2F6ff%2F6ff1f2d3-fc0d-4cb1-aceb-ec4ca4dd9f7a%2FphpCV2q6C.png" style="height:405px;width:1024px;" aria-describedby="d3f"/></p>The longest increasing subsequence problem