原书出处
Introduction to Algorithms, Fourth Edition
17 第17章 数据结构的扩张
Move a “sweep” line across the set of rectangles.) Problems 17-1 Point of maximum overlap
You wish to keep track of a point of maximum overlap in a set of intervals—a point with the largest number of intervals in the set that overlap it.
a. Show that there is always a point of maximum overlap that is an endpoint of one of the
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter017.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea