Assignment 2 hint.

If you're having trouble finding a linear solution to the skyline problem,
here's a hint:  the actual worst-case upper bound is O(max(n, width)), where n
is the number of buildings in the cityscape and width is the difference between
the largest and smallest x values for buildings in the cityscape.