-
-
-
-
-
-
-
-
Max separation problem is an interesting geometry problem: given N+1
point sets S0,S1,...,SN in 2-dimension panel, which including
k0,k1,...kN points. These points can represented by Cartesian-coordinate
as follows: Si={(xi1,yi1),...,(xik,yik)},i=0,1,...,N.
If these is a line separating S0 and p(p
Now give you the point sets S0,S1,...SN, find the max value of p.
输入描述
The first line of the input file contains an integ输出描述
Output contains only one line -- the max separation p.输入例子
2
0,0;1,1; ...
阅读题目
问答题
经典指数
-
-