![](https://img-blog.csdnimg.cn/20201014180756923.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
计算几何
Singular__point
stay foolish ,stay hungry !
展开
-
poj 2653 Pick-up sticks
Pick-up sticksTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 13844 Accepted: 5249DescriptionStan has n sticks of various length. He throws them one at原创 2017-09-26 08:30:51 · 430 阅读 · 0 评论 -
poj 3304 Segments(线段与直线相交)
SegmentsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 15494 Accepted: 4916DescriptionGiven n segments in the two dimensional space, write a program,原创 2017-09-20 21:05:11 · 276 阅读 · 0 评论 -
hdu 6206 Apple(Java大数)
AppleTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 806 Accepted Submission(s): 267Problem DescriptionApple is Taotao's favo原创 2017-09-19 14:46:01 · 919 阅读 · 0 评论 -
poj 2007 Scrambled Polygon(凸包Graham扫描线模板)
Scrambled Polygon题目链接:http://poj.org/problem?id=2007代码如下:#include#include#include#include#include#includeusing namespace std;typedef struct{ int x; int y;}Point;int n, temp;Point原创 2017-10-03 11:29:06 · 225 阅读 · 0 评论 -
HDU 1348 (凸包模板之卷包裹)
WallTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7258 Accepted Submission(s): 2099Problem DescriptionOnce upon a time ther原创 2017-09-29 21:11:39 · 254 阅读 · 0 评论 -
hdu 5120 Intersection (容斥原理+圆的相交面积模板)
IntersectionTime Limit: 4000/4000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 3674 Accepted Submission(s): 1388Problem DescriptionMatt is a b原创 2017-10-17 16:04:27 · 538 阅读 · 0 评论 -
poj 1269 Intersecting Lines(判断两条直线三种状态)
Intersecting LinesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 16792 Accepted: 7233DescriptionWe all know that a pair of distinct points on a plane原创 2017-09-21 10:39:23 · 327 阅读 · 0 评论 -
poj 2318 TOYS
TOYSTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 16340 Accepted: 7837DescriptionCalculate the number of toys that land in each bin of a partitioned原创 2017-09-19 20:18:02 · 362 阅读 · 0 评论 -
poj 2398 Toy Storage
题目链接:http://poj.org/problem?id=2398分析:2318的变形题,需要排序,不多解释了。代码如下:#include#include#include#include#include#includeusing namespace std;struct Node { int x,y;}edge[5005],node[5005];int cm原创 2017-09-19 23:20:31 · 337 阅读 · 0 评论 -
HDU 4720 Naive and Silly Muggles(三角形最小覆盖圆)
Naive and Silly MugglesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1236 Accepted Submission(s): 828Problem DescriptionThr原创 2017-09-19 16:16:12 · 483 阅读 · 0 评论 -
poj 1556 The Doors
The DoorsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 9106 Accepted: 3489DescriptionYou are to find the length of the shortest path through a chamb原创 2017-09-26 10:00:51 · 259 阅读 · 0 评论 -
poj 3335 Rotating Scoreboard(半平面交,求解多边形内核)
Rotating ScoreboardTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 7397 Accepted: 2963DescriptionThis year, ACM/ICPC World finals will be held in a ha原创 2017-10-26 14:52:46 · 343 阅读 · 0 评论