几何
summer_via
不积跬步无以至千里
展开
-
HDU - 4197几何+贪心
HDU - 4197几何+贪心 Description John loves programming contests. There is just one problem: his team is not very good at programming. This usually doesn't bother him, but what does bother him is原创 2016-07-11 19:19:16 · 373 阅读 · 0 评论 -
【几何】平面线段交
平面线段交 如果要判断平面直角坐标系中两条线段是否相交,可以用向量的内积,外积进行清晰快速的计算。 内积:p1(x1,y1),p2(x2,y2)的内积为p1*p2=x1*x2+y1*y2; 外积:p1(x1,y1),p2(x2,y2)的外积为p1xp2=x1*y2-x2*y1; 判断点是否在线段上:要判断点q是否在直线p1-p2上,之要先利用外积根据是否有(p1-q)x(p2-q)原创 2016-07-22 10:30:55 · 590 阅读 · 0 评论 -
hdu 5738 Eureka 极角排序
题目: Eureka Time Limit: 8000/4000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1921Accepted Submission(s): 568 Problem Description Professor Zhang draws...原创 2016-07-23 18:51:20 · 294 阅读 · 0 评论