As we are currently experiencing an overwhelming number of web requests for fetching user submissions, we have temporarily disabled the full submissions list. You must now be logged in to view submissions.
给定二维平面中的 $n$ 个点 $P_i(x_i, y_i)$，求他们组成的凸包的周长。
输入的第一行包含一个整数 $n$。
接下来 $n$ 行，每行两个整数 $x_i, y_i$。
输出一行一个实数表示答案。要求相对误差或绝对误差不超过 $10^{-6}$。
5
1 2
1 4
2 3
3 5
4 210.39834563766816909
1 3
1 7
2 2
2 5
2 9
3 4
3 6
4 1
5 519.0094551429903350对于 $100\%$ 的数据，$3 \leq n \leq 2 \times 10^5$，$-10^9 \leq x_i, y_i \leq 10^9$。
The discussion section is only for posting: Editorials, General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.
This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.
If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.
Guidelines: