![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
编程题——几何
文章平均质量分 85
David_Jett
我要变得很强!2017-8-30
展开
-
BestCoder Round 38-1001 Four Inages Strategy
题目链接:http://bestcoder.hdu.edu.cn/contests/contest_showproblem.php?cid=577&pid=1001题面:Four Inages Strategy Accepts: 272 Submissions: 1374 Time Limit: 2000/1000 MS (Java/Othe原创 2015-04-18 22:31:40 · 755 阅读 · 0 评论 -
BestCoder Round #50 (div.2) HDU 5365 Run(简单几何)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5365题面:(严重吐槽,看着真不舒服,还是改一下吧)RunTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 5原创 2015-08-09 14:37:05 · 1064 阅读 · 0 评论 -
HDU 5218 The E-pang Palace (简单几何—2014广州现场赛)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5128题面:The E-pang PalaceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 1646 A原创 2015-08-13 10:28:24 · 1643 阅读 · 0 评论 -
UVALive 6859 Points (凸包)
题意: 用周长最短的多边形将给定的点都包含到多边形内。给定的都是整数点,要求多边形的顶点也为整数点,且最小单位只能为1或根号2,即为单元格边长或单元格斜线。一开始,就觉得是凸包,但想得是把给定的点求一次凸包,再把凸包上的点的周围上下左右四个点构成的集合求个凸包。然而正确的解法是将所有的点的周围四个点构成的集合去重后,求凸包。得到解法后,想想还是有道理的。求出凸包的点后,用下式计算即可。x原创 2015-07-15 13:08:25 · 1056 阅读 · 2 评论 -
HDU 5733 tetrahedron(几何——四面体内心/体积/内切圆)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5733题面:tetrahedronTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 399 Accepted Sub原创 2016-07-20 14:20:11 · 1839 阅读 · 0 评论 -
ZOJ 3866 Cylinder Candy
题目链接:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=5478题面:Cylinder CandyTime Limit: 2 Seconds Memory Limit: 65536 KB Special JudgeEdward the confectioner is原创 2015-04-12 22:59:29 · 1345 阅读 · 7 评论