ACM必做50题的解题-计算几何（The ACM is going to do 50 problem solving -- calculate the geometry）.docVIP

下载本文档

7
0
约1.48万字
约 52页
2017-07-21 发布于河南
举报
版权申诉

ACM必做50题的解题-计算几何（The ACM is going to do 50 problem solving -- calculate the geometry）.doc

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

ACM必做50题的解题-计算几何（The ACM is going to do 50 problem solving -- calculate the geometry）

ACM必做50题的解题-计算几何（The ACM is going to do 50 problem solving -- calculate the geometry） The ACM does 50 problem solving - computational geometry. TXT is used for business, not for calculation. Relationships are meant to be maintained, not tested. Love is for love, not for harm. Money is for enjoyment, not for measurement. Lies are used to break, not to decorate. Trust is for settling, not for challenging. POJ 1113 WALL Calculate the geometry and find the convex hull The result of this is equal to the circumference of the convex hull of this polygon plus the circumference of the circle with radius of the radius The steps are as follows: 1) the algorithm first seeks to find the lowest point on the bottom, and if the y-coordinate is the same, then the smallest point of the x-coordinate is found 2) then rank the Angle of the first p relative to the first p according to all the points, and only take the distance when the Angle is equal The farthest point of firstP (sorting by hand, by hand) 3) and then use the Graham algorithm to find the convex hull 4) go for the job directly # include iostream # include cmath # define PI (3.1415926) # define MAX_N 1000 Using namespace STD. / / store the original input value, and rad is the radius of the input Double cord [MAX_N + 2] [2], rad; Int seq [MAX_N + 2]; Int stack [MAX_N + 2]; Int n, top; Int firstP; Int realN; Void swap (int pos1, int pos2) { Int temp = seq [pos1]; Seq [pos1] = seq [pos2]; Seq [pos2] = temp; } Int dir (int nodes, int node1, int node2) { Double x1 = cord [node1] [0], y1 = cord [node1] [1]; Double x2 = cord [node2] [0], y2 = cord [node2] [1]; Double sx = cord [nodes]. Return (x2 - sx) * (y1 - sy) - (x1 - sx) * (y2 - sy); } Double getDist (int node1, int node2) { Double x1 = cord [node1] [0], y1 = cord [node1] [1]; Double x2 = cord [node2] [0], y2 = cord [node2] [1]; Double res = SQRT ((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); Return res; } Int compare (int node1, int node2) { Double x1 = cord [node1] [0