码代码的猿猿

维护次大和最大的左下角和右上角的坐标，再枚举抽出哪一个矩阵。。。SlidesTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 923    Accepted Submission(s): 311Proble

欧拉定理 V-E+F=C+1Problem GHow Many Pieces of Land?Input: Standard InputOutput: Standard OutputTime Limit: 3 seconds You are given an elliptical shaped land and you are asked to ch

凸包旋转卡壳求最大三角形面积最大三角形Time Limit: 5000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3316    Accepted Submission(s): 1119Problem Description

增量法最小圆覆盖,简单模版Buried memoryTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2541    Accepted Submission(s): 1365Problem Descri

来自:http://blog.csdn.net/tiaotiaoyly/article/details/20874981，质量集中在顶点上。n个顶点坐标为(xi,yi)，质量为mi，则重心　　X = ∑( xi×mi ) / ∑mi　　Y = ∑( yi×mi ) / ∑mi　　特殊地，若每个点的质量相同，则　　X = ∑xi  / n　　Y = ∑yi  / n

增量法最小圆覆盖....Maple treesTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1646    Accepted Submission(s): 510Problem Descript

半平面交+二分二分距离,判断是否有半平面交,精度要求很高Most Distant Point from the SeaTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 4163 Accepted: 1942 Special Judge

枚举两个点当做0号点的相邻两边，判断两边长度是否相等和垂直，然后用向量推最后一个点，比较是否相等Four Inages StrategyTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 375    Accepted Su

WallTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4001    Accepted Submission(s): 1131Problem DescriptionOnce upon a time ther

凸包+选择卡壳 ..... 测试模板Beauty ContestTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 29721 Accepted: 9192DescriptionBessie, Farmer John's

裸的半平面交求多边形是否有核.多边形的核: 在多边形核上的点可以看到多边形的所有顶点,凸多边形的核显然就是多边形本身.多边形的核是一个凸包,对多边形的所有边都做向着多边形的半平面交在判断一下是否构成凸包就可以了一样的题目还有POJ3335Video SurveillanceTime Limit: 1000MS Memory

裸的:半平面交+求多边形核的面积Art GalleryTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 5735 Accepted: 2419DescriptionThe art galleries of the ne

按斜率排序,斜率线相同的直线取截距最大的一条直线能够被看到的条件是,与比它斜率小的交点在比它斜率大的交点的左侧1007: [HNOI2008]水平可见直线Time Limit: 1 Sec  Memory Limit: 162 MBSubmit: 4234  Solved: 1558[Submit][Status][Discuss]Description 在

将所有的圆化成树,然后就可以转化成树上的删边博弈问题....Circles GameTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 881    Accepted Submission(s): 255Pr

枚举出每一个矩形,判断相交如果是回字型则输出大的矩形的面积..........The E-pang PalaceTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 73    Accepted Submission(s):

当是钝角三角形时,就是最长边为直径的圆最小.否则,求三角形的外接圆Naive and Silly MugglesTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 700    Accepted Submission(s

3年前刚接触ACM的时候做的这一题,交了几十次怎么写都过不了.........今天无意中又看到了这一题,随手一写终于过了.....Quoit DesignTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 33151 

裸的最近点对....D. Tricky Functiontime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIahub and Sori

分治，选最左上的点分给根，剩下的极角排序后递归C. Paint Treetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou ar

暴力+枚举点用边长关系判断立方体B. Restore Cubetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPeter had a

枚举角度Crazy TankTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4305    Accepted Submission(s): 833Problem DescriptionCrazy

计算几何：题解转自:点击打开链接首先我们想一下如果甲乙都仅沿着两条线段向前跑,那么他们之间的最短和最长距离怎么算? 假设甲的速度向量为v1(速度向量指甲单位时间所走的位移向量),乙的速度向量为v2. 那么可以把甲看成是静止不动的,而让乙一个人以v2-v1的速度向量去运动(画图验证下).       且假设甲和乙都运动了t秒时间,那么我们可以知道上面的过程类似于甲不动

计算几何： 堆几何模版就可以了。。。。DescriptionProblem E2D Geometry 110 in 1!This is a collection of 110 (in binary) 2D geometry problems.CircumscribedCircle x1 y1 x2 y2 x3 y3Fi

4*4*4*4暴力+点的旋转+判断正方型C. Captain Marmottime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputCaptai

计算几何：按顺序给n个圆覆盖，问最后可以有几个圆被看见。。。对每个圆求和其他圆的交点，每两个交点之间就是可能被看到的圆弧，取圆弧的中点，往外扩展一点或者往里缩一点，从上往下判断有没有圆可以盖住这个点，能盖住这个点的最上面的圆一定是可见的Viva ConfettiTime Limit: 2 Seconds      Memory Limit: 65536 KBDo

多边形凸包。。。。Board WrappingTime Limit: 3000MSMemory Limit: Unknown64bit IO Format: %lld & %lluSubmit StatusDescriptionProblem BBoard WrappingInput: st

计算几何： 最基本的计算几何，差积  旋转                                                                                                         Morley's TheoremTime Limit: 3000MSMemory Limit: Unkn

欧拉定理：P+F-E=2That Nice Euler CircuitTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescriptionLittle Joey inve

两圆面积交....IntersectionTime Limit: 4000/4000 MS (Java/Others)    Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 101    Accepted Submission(s): 38Problem Description

Circular AreaTime Limit: 2 Seconds      Memory Limit: 65536 KBYour task is to write a program, which, given two circles, calculates the area of their intersection with the accuracy of three

暴力枚举角度.....Stealing a CakeTime Limit: 5000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2495    Accepted Submission(s): 681Problem Descripti