PointA 第6页

POJ 2352 树状数组

include usingnamespacestd; intc[15555],n,lev[15555]; structpoint { intx,y,pos; }p[15555]; boolcmp1(pointa

sevenster·2012-04-16 17:00

POJ-3681（搜能包住m个点的最小矩形面积）

直接上codeintm,n; structpoint { intx,y; }wo[205]; boolcmp(pointa,pointb) { if(a.x=wo[i].x&&wo[k].x<=wo[j

famousDT·2012-03-26 17:00

POJ-2002,3432（搜点，hash或二分）

但只有一个正方形：#defineN2001 #defineSUM40005 intn; intnext[N],hash[SUM]; structpoint { intx,y; }p[N]; boolcmp(pointa

famousDT·2012-03-07 11:00

hdu 3549 Enumerate the Triangles

暴力过了#include #include #include usingnamespacestd; structpoint{ doublex,y; }p[1001]; inlinedoubledis(pointa

wxfwxf328·2012-02-02 20:00

Linux中Load average的理解

fixed-pointa

xxd851116·2011-12-09 13:00

POJ 1269 Intersecting Lines (两直线之间的位置关系）

(x):-(x))Pointa,b;}; struct

Tsaid·2011-11-06 16:00

The 36th ACM/ICPC Asia Regional Dalian Site —— Online Contest hdu4007

#include#include#include#include#includeusingnamespacestd;structpoint{ intx,y;}a[1005];boolcmp(pointa

Mr_JJ_Lian·2011-09-05 21:00

ZOJ 3508 The War

#include #include #include usingnamespacestd; intn,m; structpoint { intMin,Max; }p[40009]; boolcmp(pointa

wsniyufang·2011-08-28 22:00

我是蒟蒻！！！！别再在脑子里面出乱子了！！！【判断点在线段上的写法！】

boolcheck(pointp,pointa,pointb){if((comp(a.x-p.x)=0&&comp(p.x-b.x)>=0)){if((comp(b.y-p.y)>=0&&comp(p.y-a.y

From A Start,As An Acmer·2011-08-20 10:00

poj 2546 Circular Area

#include #include #include #include #include #include usingnamespacestd; structpoint{doublex,y;}; pointa

zxy_snow·2011-07-04 19:00

UVA 634 Polygon

include#include#include#includeusingnamespacestd;constintMAX=1010;structpoint{doublex,y;};structsegment{pointa

zxy_snow·2011-06-21 12:00

zoj 2157 || poj 1788 Building a New Depot

include#include#includeusingnamespacestd;constintMAX=100010;structpoint{intx,y;};pointp[MAX];boolcmp(pointa

zxy_snow·2011-05-03 16:00

poj 1329 Circle Through Three Points

include#include#include#include#include#includeusingnamespacestd;structpoint{doublex,y;};structline{pointa

zxy_snow·2011-04-24 19:00

poj 2464

defineMAXN200002intind_x[MAXN];intind_y[MAXN];intsum_x[MAXN];intsum_y[MAXN];structpoint{intx,y;}p[MAXN];boolcomp(pointa

whosemario·2011-04-23 21:00

zoj 1090 || poj 2242 The Circumference of the Circle

#include#includeusingnamespacestd;constdoublepi=3.141592653589793;structpoint{doublex,y;};doubledis(pointa

zxy_snow·2011-04-17 17:00

zoj 1453 Surround the Trees（我的第一个凸包，哇咔咔）

includeusingnamespacestd;constintMAX=120;typedefstructPoint{doublex,y;}Point;Pointc[MAX];doublecrossProduct(Pointa

zxy_snow·2011-04-11 23:00

hdu 1086 You can Solve a Geometry Problem too

include#include#include#includeusingnamespacestd;typedefstructPoint{doublex,y;}Point;typedefstructLine{Pointa

zxy_snow·2011-04-07 19:00

hdu_2202_凸包求最大三角形

include#include#includeusingnamespacestd; structpoint{intx,y;}a[50001],stack[50001],flag;intn; intsect(pointa

u012523797·2011-02-19 19:00

c#3.0中的新特性（2）

publicstaticclassMethodsExtentions{publicstaticdoubleDistance(thisPointpointA,pointpointB){returnMath(Sqrt(Math.Pow(pointA.X–pointB.X

netatomy·2011-01-06 17:00

HDU 3400 Line belt

include#defineeps1e-5usingnamespacestd;structpoint{doublex;doubley;};pointdata[4];doublep,q,r;doubledis(pointa

ACb0y·2010-12-26 23:00

C语言平面几何15-线段的垂直平分线

/*线段的垂直平分线*/ LinePerpendicularBisector(PointA,PointB) { Pointm;//中点 m.x=(A.x+B.x)/2; m.y=(A.y+B.y

hbuxiaoshe·2010-10-26 22:00

C语言平面几何12-向量方法判断线段与矩形是否有交集

intRSIntersection(Rectangler,PointA,PointB) { MBRm1=(MBR)r; MBRm2=MbrConstruct(A,B); //快速排斥 if(MbrOverlap

hbuxiaoshe·2010-10-17 11:00

模板[点在多边形内的判断]

(x):-(x))pointa,b;};doublexmult(pointp1,pointp2,pointp0){return

abcjennifer·2010-09-09 10:00

C语言平面几何4-两线段是否相交

给出C语言代码如下：/* *由两个点构造一个向量 */ VectorVectorConstruct(PointA,PointB) { Vectorv; v.x=B.x-A.x; v.y=B.y-A.y

hbuxiaoshe·2010-08-19 22:00

C语言平面几何3-点是否在线段上

=|AB|（2）通过向量叉积判断，点在线段上向量AP×向量AB=0，并且点P坐标在AB坐标之间C语言代码如下：/*点是否在线段上:距离判断*/ intPointIsOnSegment(PointP,PointA

hbuxiaoshe·2010-08-19 21:00

C语言平面几何2-距离、长度、模的计算

（1）计算两点之间的距离，或线段的长度/*两点之间的距离，线段的长度*/ doubleDistanceOfPoints(PointA,PointB) { return(double)sqrt((A.x-B.x

hbuxiaoshe·2010-08-17 22:00

C语言平面几何1-数据类型的定义

{ doublex; doubley; }Point; /*向量*/ typedefPointVector; /*线段AB*/ typedefstructsegment { PointA

hbuxiaoshe·2010-08-17 21:00

Android游戏开发之连连看算法

首先是横向检测： privatebooleanhorizon(Pointa,Pointb) { if(a.x==b.

raymondlueng·2009-09-29 00:00

计算几何算法总集

1:-1;}doubledet(doublex1,doubley1,doublex2,doubley2){ return x1*y2-x2*y1;}doublecross(Pointa,Pointb,Po

Feng.Li's Java See·2007-09-07 15:00

使用对象指针访问类的成员

returnX;} intGetY(){returnY;}private: intX; intY;};#include#include"pointer0.h"//使用对象指针访问类的成员voidmain(){PointA

longfengxiang·2007-08-25 08:00

推荐频道

PointA