原题题面
Given n n n points in 2D plane. Considering all circles that the origin point ( 0 , 0 ) (0,0) (0,0) is on their boundries, find the one with the maximum given points on its boundry. Print the maximum number of points.
输入描述
The first line contains one integer ( 1 ≤ n ≤ 2000 ) (1≤n≤2000) (1≤n≤2000), denoting the number of given points.
Following {n}n lines each contains two integers x, y$ (∣x∣,∣y∣≤10000)$, denoting a given point ( x , y ) (x,y) (x,y).
It’s guaranteed that the points are pairwise different and no given point is the origin point.
输出描述
Only one line containing one integer, denoting the answer.
输入样例
4
1 1
0 2
2 0
2 2
输出样例
3
题面解析
首先很容易就能想到 O ( n 3 ) O(n^3) O(n3)的暴力方法，但显然会超时。
先放出题人的方法，出题人给出了圆周角的方法计算（下图）
最低0.47元/天 解锁文章
490
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
