Solution: Greedy Algorithms
Solution to the problem related to greedy algorithms.
We'll cover the following...
Let's practice what we've learned so far.
Task
We’ve been hired to store a sequence of books on shelves in a library. The order of the books is fixed by the cataloging system and can’t be changed; each shelf must store a contiguous interval of the given sequence of books. We are given two arrays and , where and are respectively the height and thickness of the -th book in the sequence. All shelves in this library have the same length ; the total thickness of all books on any single shelf can’t exceed . Suppose all the books have the same height ...