ACM_计算几何强化
acceptedwwh
当代大学生,阳光开朗,乐于交往和求知!
展开
-
POJ1269 Intersecting Lines
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 8206 Accepted: 3736DescriptionWe all know that a pair of distinct points on a plane defines a line and that a pair of原创 2013-06-04 21:24:46 · 1143 阅读 · 0 评论 -
FZUACM Problem 1120 A Pilot in Danger!
#include #include #include #include #include #include using namespace std;//2013-06-05 17:19:28 Accepted 1120 GNU C++ 0 ms 856KB 2352B const double eps = 1e-8;int dcmp(double x) { i原创 2013-06-05 17:23:00 · 1340 阅读 · 0 评论 -
HDU 1392 Surround the Trees
几何凸包原创 2014-04-29 20:59:53 · 974 阅读 · 0 评论 -
ZOJ1081 Points Within
几何:判断点在多边形内外原创 2014-04-29 21:16:10 · 985 阅读 · 0 评论 -
POJ2653 Pick-up sticks
POJ2653线段相交原创 2014-04-29 21:04:26 · 951 阅读 · 0 评论 -
FZU 2148 Moon Game
计算几何原创 2014-05-08 20:26:35 · 1129 阅读 · 0 评论 -
POJ1654
几何原创 2014-04-26 13:49:17 · 967 阅读 · 0 评论 -
HDU 4709 Herding
几何原创 2014-04-26 13:53:50 · 1059 阅读 · 0 评论 -
HDU1086 You can Solve a Geometry Problem too
PS: 主要解决线段相交中规范相交和不规范xian。原创 2014-04-26 13:56:32 · 712 阅读 · 0 评论 -
G++和C++ && POJ 1113 Wall
G++和C++的思考 POJ1113.原创 2014-04-27 20:29:13 · 1191 阅读 · 0 评论 -
POJ2007 Scrambled Polygon
极角排序原创 2014-04-27 10:00:54 · 956 阅读 · 0 评论 -
HDU 1115 Lifting the Stone
几何:多边形重心原创 2014-04-27 20:06:56 · 973 阅读 · 0 评论 -
POJ 1269 Intersecting Lines
直线相交问题原创 2014-04-27 20:13:03 · 972 阅读 · 0 评论 -
uva 11178 - Morley's Theorem(训练指南)
思路:这题注意练习一下向量的旋转,和直线的相交。注意代码中用vector表示向量,用point表示点,这一点还是非常好的。今天是六一儿童节哈,在图书馆A题,呵呵。using namespace std;struct point { double x; double原创 2013-06-01 09:41:55 · 1583 阅读 · 2 评论 -
POJ1279 Art Gallery
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 4300 Accepted: 1849DescriptionThe art galleries of the new and very futuristic building of the Center for Balkan Coo原创 2013-06-04 15:45:37 · 1137 阅读 · 0 评论 -
POJ2451Uyuw's Concert
思路:刚开始没看懂题意,其实和求多边形的核类似,这是求半平面的交。开始我感觉用复数表示点,很不习惯,以前从没用过。poing a; 然后这样给a赋值a.imag() = 0;用C++提交时就一直CE,然后问冰哥,他说在他的DEV c++上有警告,然后我就改为初始化成员列表然后就AC啦,还是挺兴奋的!#include #include #include #include #i原创 2013-06-04 19:21:13 · 1672 阅读 · 0 评论 -
判断点在多边形内外(角度判别法)
#include#include#define MAX 10000#define PI 3.141592653589793using namespace std;typedef struct point{ double x, y;}point;bool Is_inline(point Q, point Pi, point Pj){ if((Q.x-Pi.x)*(Pj.y原创 2012-10-04 17:23:14 · 3301 阅读 · 0 评论 -
求凸包(Graham-Scan)
#include #include #include #include using namespace std;const int MAX = 1000;typedef struct point{ int x, y; int flag;}point;point list[MAX];int stack[MAX], top;void swap(point &a, po原创 2012-10-05 11:48:04 · 996 阅读 · 0 评论 -
极角排序(叉积)
#include #include #include #include using namespace std;const int MAX = 1000;typedef struct point{ int x, y; int flag;}point;point list[MAX];int stack[MAX], top;void swap(point &a, po原创 2012-10-05 10:08:21 · 1684 阅读 · 0 评论 -
计算三角形面积(叉积)
#include #include #include using namespace std;typedef struct point{ double x; double y;}point;double CrossProduct(point A, point B, point C){ return (B.x-A.x)*(C.y-A.y) - (B.y原创 2012-09-17 22:09:03 · 2004 阅读 · 1 评论 -
hdu2036(改革春风吹满地)
#include #include #include #include #include using namespace std;const int maxn = 110;struct Point{ double x, y; Point(double x = 0, double y = 0):x(x), y(y) { }};typedef Point Vect原创 2013-05-02 17:45:27 · 1430 阅读 · 0 评论 -
hdu2080(夹角有多大II)
此题难度不大,但是收获不小,在计算中尽量少用除法。。。下面给出两个代码,其中一个是错误的答案,比较两者的区别。。。//wrong#include #include #include using namespace std;struct Point{ double x, y; Point(double x = 0, double y = 0):x(x), y(y) { }原创 2013-05-02 20:25:04 · 1413 阅读 · 0 评论 -
POJ Pick-up sticks
Pick-up sticksTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 7550 Accepted: 2789DescriptionStan has n sticks of various length. He throws them one at a t原创 2013-05-22 16:44:33 · 974 阅读 · 0 评论 -
POJ1410 Intersection
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 9733 Accepted: 2566DescriptionYou are to write a program that has to decide whether a given line segment intersects a原创 2013-05-23 20:49:53 · 1209 阅读 · 2 评论 -
POJ1113Wall(计算几何基础)
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 25657 Accepted: 8532DescriptionOnce upon a time there was a greedy King who ordered his chief Architect to build a wal原创 2013-05-25 21:23:14 · 1970 阅读 · 0 评论 -
POJ2187Beauty Contest(求凸多边形直径)
Time Limit: 3000MS Memory Limit: 65536KTotal Submissions: 23706 Accepted: 7244DescriptionBessie, Farmer John's prize cow, has just won first place in a bovine beauty contest, e原创 2013-05-25 20:15:22 · 2028 阅读 · 0 评论 -
hdu1392(Surround the Trees)凸包问题
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5804 Accepted Submission(s): 2192Problem DescriptionThere are a lot of trees in an ar原创 2013-05-25 19:39:30 · 1183 阅读 · 0 评论 -
uva 10652 Board Wrapping
本题是很不错的凸包题目:考查向量的旋转,求凸包,求凸包的面积。今天是儿童节的第三题。#include #include #include #include #include #include #include using namespace std;const int maxn = 2500;const double pi = acos(-1);double area1原创 2013-06-01 21:11:06 · 1331 阅读 · 0 评论 -
LA4728 Squares
思路:用旋转卡壳求最远点对。#include #include #include #include #include #include #define next(i) ((i+1)%n)using namespace std;const double maxn = 401000;const double eps = 1e-8;int dcmp(double x) {原创 2013-06-01 21:41:10 · 1351 阅读 · 0 评论 -
uva 11168 Airport(训练指南)
思路:特殊情况,点在一条直线上,求凸包的时候可以检查出来,n等于1的时候是个特殊情况。求点到直线的距离,因为点在直线Ax + By + C = 0同侧。所以对于任意n个点中的一个点 (X0, Y0) , Ax0 + By0 + C 应该正负号相同。用直线的一般式就可以用O(1)的时间求一条直线上的距离。儿童节第二题,哈哈。#include #include #includ原创 2013-06-01 14:34:39 · 1284 阅读 · 0 评论 -
HDU5206Four Inages Strategy
HDU5206Four Inages Strategy原创 2015-04-23 14:36:11 · 620 阅读 · 0 评论