Page 109 of chapter 3.6 has a description of the two-dimensional array LISbigger. It is described as being LISbigger[0..n, 1..n] (in bold around the middle of the page), but it should be LISbigger[0..n, 1..n+1], i.e. the columns should go up to n+1, not n. The algorithm FastLIS on page 110 starts by initializing column n+1 of LISbigger.
Page 109 of chapter 3.6 has a description of the two-dimensional array LISbigger. It is described as being LISbigger[0..n, 1..n] (in bold around the middle of the page), but it should be LISbigger[0..n, 1..n+1], i.e. the columns should go up to n+1, not n. The algorithm FastLIS on page 110 starts by initializing column n+1 of LISbigger.