Wu Shixiong's Large Model Academy

Nov 5, 2023 · Interview Experience

Maximizing Stacked Books: DP & LIS Solution for 2023B Problem

This article explains how to compute the maximum number of books that can be stacked without rotation by converting the problem into a longest increasing subsequence (LIS) task, sorting books by length and width, applying a dynamic‑programming DP approach, and analyzing its time and space complexities.