| 시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
|---|---|---|---|---|---|
| 2 초 | 512 MB | 118 | 61 | 53 | 50.000% |
You are given $n$ points on the plane. You have to choose such a straight line, that there will be points on both sides of the line and the minimum distance from one of the points to the line should be the maximum possible. Find this distance.
The first line contains a single integer $n$ --- the number of the points (2ドル \le n \le 2,000円$).
Each of the following $n$ lines contains two integers $x_i$ and $y_i$ --- coordinates of $i$-th point ($|x_i|, |y_i| \le 10^9$).
It's guaranteed that no two points coincide.
Print single real number --- an answer. Your answer will be considered correct if its absolute or relative error doesn't exceed 10ドル^{-9}$.
| 번호 | 배점 | 제한 |
|---|---|---|
| 1 | 11 | $n \le 10$ |
| 2 | 19 | Points form strictly convex non-degenerate polygon, given in the counter clockwise order, 3ドル \le n$ |
| 3 | 23 | $n \le 100$ |
| 4 | 31 | $n \le 1,000円$ |
| 5 | 16 | No additional constraints |
4 0 0 0 1 1 0 1 1
0.50000000000
2 -12 34 56 -78
65.51335741664
8 0 0 2 0 5 1 5 3 4 5 3 4 1 4 0 2
1.10000000000
A picture for the third example: