摘要：
转自Scar的个人网站 heroscar.comTOYSTime Limit:2000MSMemory Limit:65536KTotal Submissions:7587Accepted:3598DescriptionCalculate the number of toys that land in each bin of a partitioned toy box.Mom and dad have a problem – their child John never puts his toys away when he is finished playing with them. They 阅读全文
随笔分类 - ACM_计算几何
poj 1113 Wall----凸包 (给自己的一句话: 没AC,没理由!)
2012-05-17 14:22 by java环境变量, 266 阅读, 收藏,
摘要：
WallTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 21867Accepted: 7174DescriptionOnce upon a time there was a greedy King who ordered his chief Architect to build a wall around the King's castle. The King was so greedy, that he would not listen to his Architect's proposals to build 阅读全文
poj 1269 Intersecting Lines -----计算几何
2012-04-19 20:05 by java环境变量, 295 阅读, 收藏,
摘要：
Intersecting LinesTime Limit:1000MSMemory Limit:10000KTotal Submissions:6451Accepted:3023DescriptionWe all know that a pair of distinct points on a plane defines a line and that a pair of lines on a plane will intersect in one of three ways: 1) no intersection because they are parallel, 2) intersect 阅读全文
poj 1654 Area ----- 计算几何
2012-04-19 19:55 by java环境变量, 335 阅读, 收藏,
摘要：
AreaTime Limit:1000MSMemory Limit:10000KTotal Submissions:9899Accepted:2800DescriptionYou are going to compute the area of a special kind of polygon. One vertex of the polygon is the origin of the orthogonal coordinate system. From this vertex, you may go step by step to the following vertexes of th 阅读全文
poj 1005 I Think I Need a Houseboat-----计算几何
2012-04-11 16:45 by java环境变量, 209 阅读, 收藏,
摘要：
I Think I Need a HouseboatTime Limit:1000MSMemory Limit:10000KTotal Submissions:68186Accepted:28756DescriptionFred Mapper is considering purchasing some land in Louisiana to build his house on. In the process of investigating the land, he learned that the state of Louisiana is actually shrinking by 阅读全文
【转载】ACM计算几何题目推荐
2012-02-03 01:33 by java环境变量, 297 阅读, 收藏,
摘要：
一。基础题目 1.1 有固定算法的题目 A， 最近点对问题最近点对问题的算法基于扫描线算法。ZOJ 2107 Quoit Design 典型最近点对问题POJ 3714 Raid 变种最近点对问题B，最小包围圆最小包围圆的算法是一种增量算法，期望是O(n)。ZOJ 1450 Minimal CircleHDU 3007 Buried memoryC，旋转卡壳POJ 3608 Bridge Across Islands 旋转卡壳解两凸包最小距离POJ 2079 Triangle 旋转卡壳计算平面点集最大三角形1.2 比较简单的题目 HDU 3264 Open-air shopping mal.. 阅读全文
浙公网安备 33010602011771号