排序:
默认
按更新时间
按访问量

Polyline Simplification (计算几何)

Polyline Simplification 时间限制: 5 Sec  内存限制: 128 MB 提交: 35  解决: 11 [提交][状态][讨论版][命题人:admin] 题目描述 Mapping applications often represent the boun...

2018-04-25 21:05:13

阅读数:53

评论数:0

2017 ACM-ICPC 亚洲区(南宁赛区)网络赛 F. Overlapping Rectangles (面积并+线段树)

There are nn rectangles on the plane. The problem is to find the area of the union of these rectangles. Note that these rectangles might overlap with...

2017-09-24 17:08:23

阅读数:767

评论数:0

ACM-ICPC国际大学生程序设计竞赛北京赛区(2017)网络赛 E Territorial Dispute (凸包)

Territorial Dispute 时间限制:1000ms 单点时限:1000ms 内存限制:256MB 描述 In 2333, the C++ Empire and the Java Republic become the most powerful country in the world...

2017-09-23 20:56:05

阅读数:1038

评论数:0

计算几何相关(更新中)

1.向量 结构体定义点和直线 struct point{ double x,y; }; struct line{ point a,b; };两点相减求向量,重载 - 运算符 struct point{ int x,y; point(){}; ...

2017-09-17 07:53:05

阅读数:357

评论数:0

POJ 1269 Intersecting Lines

Intersecting Lines Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 16736 Accepted: 7213 Description We all know that a pair of distinct...

2017-09-12 21:10:45

阅读数:400

评论数:0

BZOJ 1007: [HNOI2008]水平可见直线

1007: [HNOI2008]水平可见直线 Time Limit: 1 Sec Memory Limit: 162 MB Submit: 7656 Solved: 2929 [Submit][Status][Discuss] Description   在xoy直角坐标平面上有n条直线L...

2017-09-12 17:43:27

阅读数:347

评论数:0

POJ 2318 TOYS (向量叉乘+二分)

TOYS Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 16287 Accepted: 7821 Description Calculate the number of toys that land in each bi...

2017-09-11 20:39:58

阅读数:456

评论数:0

HDU 5839 Special Tetrahedron(几何+暴力)

Special Tetrahedron Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 843 Accepted Submiss...

2017-08-13 20:54:11

阅读数:396

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭