What the increasing subsequence table holds

• A

  The longest increasing subsequence found anywhere within the first i elements

• B

  The number of elements before i that are smaller than it

• C

  The longest increasing subsequence that ends exactly at element i

• D

  The value of the element at the end of the best chain so far