hdoj 3585 maximum shortest distance(二分+最大团)

maximum shortest distance Problem Description There are n points in the plane. Your task is to pick k points (k>=2), and make the closest points...

2016-02-13 04:03:39

阅读数:527

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭