zoj 3386 Trick or Treat 求x轴上一点到各点的最大值中的最小值 点到线段距离 三分

Trick or Treat

--------------------------------------------------------------------------------

Time Limit: 5 Seconds      Memory Limit: 65536 KB      Special Judge

--------------------------------------------------------------------------------

Johnny and his friends have decided to spend Halloween night doing the usual candy collection from the households of their village. As the village is too big for a single group to collect the candy from all houses sequentially, Johnny and his friends have decided to split up so that each of them goes to a different house, collects the candy (or wreaks havoc if the residents don't give out candy), and returns to a meeting point arranged in advance.

There are n houses in the village, the positions of which can be identified with their Cartesian coordinates on the Euclidean plane. Johnny's gang is also made up of n people (including Johnny himself). They have decided to distribute the candy afte