hdoj 3585 maximum shortest distance(二分+最大团)
maximum shortest distanceProblem DescriptionThere are n points in the plane. Your task is to pick k points (k>=2), and make the closest points in these k points as far as possible. Inp
原创
2016-02-13 04:03:39 ·
753 阅读 ·
0 评论