2015年11月8日
poj 2007 Scrambled Polygon （极角排序模板题）
摘要： Scrambled PolygonTime Limit:1000MSMemory Limit:30000KTotal Submissions:7703Accepted:3673DescriptionA closed polygon is a figure bounded by a finite nu... 阅读全文
posted @ 2015-11-08 20:09 111qqz 阅读(254) 评论(0) 推荐(0) 编辑
极角排序的几种常见的方式
摘要： 先介绍几种极角排序：1.利用叉积的正负来作cmp.(即是按逆时针排序).此题就是用这种方法1 bool cmp(const point &a, const point &b)//逆时针排序 2 {3 point origin;4 origin.x = origin.y = 0;5 ... 阅读全文
posted @ 2015-11-08 16:56 111qqz 阅读(175) 评论(0) 推荐(0) 编辑
poj 2318 TOYS (计算几何）
摘要： TOYSTime Limit:2000MSMemory Limit:65536KTotal Submissions:12453Accepted:6013DescriptionCalculate the number of toys that land in each bin of a partiti... 阅读全文
posted @ 2015-11-08 15:34 111qqz 阅读(153) 评论(0) 推荐(0) 编辑
poj 2074 Line of Sight (计算几何，细节题)
摘要： Line of SightTime Limit:1000MSMemory Limit:30000KTotal Submissions:3935Accepted:1229DescriptionAn architect is very proud of his new home and wants to... 阅读全文
posted @ 2015-11-08 15:30 111qqz 阅读(199) 评论(0) 推荐(0) 编辑