This preview shows page 1. Sign up to view the full content.
Unformatted text preview: we can make by cutting up and selling our rod of length n . Problem 3. [Billboards] Consider a stretch of Interstate-57 that is m miles long. We are given an ordered list of mile markers, x 1 ,x 2 ,...,x k in the range 0 to m , at each of which we are allowed to construct billboards (suppose they are given as an array X [1 ...k ]). Suppose we can construct billboards for free, and that we are given an array R [1 ...k ], where R [ i ] is the revenue we would receive by constructing a billboard at location X [ i ]. Given that state law requires billboards to be at least 5 miles apart, give an eﬃcient algorithm to compute the maximum revenue we can acquire by constructing billboards. 1...
View Full Document
This note was uploaded on 01/22/2011 for the course CS 473 taught by Professor Chekuri,c during the Fall '08 term at University of Illinois, Urbana Champaign.
- Fall '08