极角排序
newhonor
可以不伟大,但不能卑微
展开
-
Surround the Trees
http://acm.hdu.edu.cn/showproblem.php?pid=1392 思路:凸包求周长; 总结:填坑 #include<algorithm> #include<set> #include<cmath> #include<cstring> #include<iostream> #include<set&...原创 2019-07-09 10:25:52 · 181 阅读 · 0 评论 -
Angle Beats
http://acm.hdu.edu.cn/showproblem.php?pid=6731 //#include <iostream> //#include <cstring> //#include <queue> //#include <vector> //#include <algorithm> //#include <c...原创 2019-10-11 13:26:50 · 120 阅读 · 0 评论