当前你的浏览器版本过低，网站已在兼容模式下运行，兼容模式仅提供最小功能支持，网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器：

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

5277：YJC counts stars

题目描述
YJC is an old driver of mini train. One night he looked up to the sky and realised that the sky can be abstracted as a plane G and the stars can be abstracted as some points in the plane.
He labeled the points from $1$ to $n$. Also, he couldn't find a line crossing three points. YJC connected some points with some segments. But he made sure the segments wouldn't cross each other. YJC is extremely interested in some subsets of the points in which every two points are connected. He wants to find the subsets with maximum points and count them.
输入解释
Multiple tests.

For each test:

The first line lie two integers $n,m$,indicating the number of points and the number of segments in G.
The next $n$ lines each line lie two integers $x,y$, indicating the coordinates of the $i$th point.
The next $m$ lines each line lie two integers $u,v$, indicating an segment (u,v).
输出解释
For each test:

Two integers sz and sum, representing the number of the maximum points and the number of the maximum subsets.
输入样例 
2 1
1 1
2 2
1 2
3 3
1 1
2 2
4 5
1 2
2 3
3 1
输出样例 
2 1
3 1
提示
$1 \leq n \leq 1000$ $1 \leq T \leq 5$(T represents the number of testcases)
It is guaranteed that no two edges or points are exactly the same and $u \neq v$.
$-1e9 \leq x,y \leq 1e9$
来自杭电HDUOJ的附加信息
Recommend hujie
该题目是Virtual Judge题目，来自 杭电HDUOJ
题目来源 BestCoder Round #46
源链接： HDU-5277
最后修改于 2020-10-25T23:21:16+00:00 由爬虫自动更新
共提交 0 次
通过率 --%
时间上限 内存上限
2000/1000MS(Java/Others) 524288/262144K(Java/Others)