摘要: The problem. Given a set of N distinct points in the plane, draw every (maximal) line segment that connects a subset of 4 or more of the points.Point ... 阅读全文
posted @ 2014-10-21 21:03 maverick_fu 阅读(2140) 评论(0) 推荐(0)