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

建议使用的浏览器:

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

3370:Guard

题目描述
You got a new guard offer yesterday. Now you are at the company, and your boss asks you to stand at somewhere to do your job -- guard.
You can treat the building as a simple polygon, and your job is finding a position to make sure that you can see the largest area. Please notice that, you have a range of vision, that you cannot see what is out of that range. The wall of building can also block your sight.

Look at that image; if you stand at the middle then you can see the gray area.
输入解释
The input consists of multiple test cases. The first line of each case contains two integers n (0 <= n <= 10) and r(0 <= r <= 100). The next n lines contain a simple polygon that consists of n points, indicating the building. The absolute value of each coordinate won’t be more than 100.
The last case is followed by a line containing two zeros which should not be processed.
输出解释
Output the largest area that you can see. Please take it with two fractional digits and make sure that your program won’t output “-0.00”.
输入样例
3 1
0 0
2 0
0 2

3 1
0 0
1 0
0 1
0 0
输出样例
1.81
0.50
来自杭电HDUOJ的附加信息
Recommend lcy

该题目是Virtual Judge题目,来自 杭电HDUOJ

源链接: HDU-3370

最后修改于 2020-10-25T23:02:51+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
30000/15000MS(Java/Others) 65536/65536K(Java/Others)