随笔分类 -  计算几何-凸包

摘要:地址:http://poj.org/problem?id=3608 题目: Bridge Across Islands Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 11259 Accepted: 3307 Special Ju 阅读全文
posted @ 2017-10-12 13:44 weeping 阅读(369) 评论(0) 推荐(0) 编辑
摘要:地址:http://poj.org/problem?id=1228 题目: Grandpa's Estate Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 14326 Accepted: 4004 Description Bei 阅读全文
posted @ 2017-10-04 16:42 weeping 阅读(181) 评论(0) 推荐(0) 编辑
摘要:地址:http://codeforces.com/contest/801/problem/D 题目: D. Volatile Kite time limit per test 2 seconds memory limit per test 256 megabytes input standard i 阅读全文
posted @ 2017-04-20 15:30 weeping 阅读(262) 评论(0) 推荐(0) 编辑
摘要:地址:http://codeforces.com/problemset/problem/70/D 题目: D. Professor's task time limit per test 1 second memory limit per test 256 megabytes input standa 阅读全文
posted @ 2017-03-07 22:44 weeping 阅读(653) 评论(0) 推荐(0) 编辑
摘要:地址:http://poj.org/problem?id=3384 题目: Feng Shui Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 5551 Accepted: 1667 Special Judge Descripti 阅读全文
posted @ 2017-02-07 21:47 weeping 阅读(817) 评论(0) 推荐(0) 编辑
摘要:地址:http://poj.org/problem?id=1279 题目: Art Gallery Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 7329 Accepted: 2938 Description The art g 阅读全文
posted @ 2017-02-07 11:27 weeping 阅读(313) 评论(0) 推荐(0) 编辑
摘要:求半平面交的算法是zzy大神的排序增量法。 1 ///Poj 1474 2 #include <cmath> 3 #include <algorithm> 4 #include <cstdio> 5 using namespace std; 6 const double eps = 1e-10; 7 阅读全文
posted @ 2017-02-06 23:13 weeping 阅读(385) 评论(0) 推荐(0) 编辑
摘要:地址:http://poj.org/problem?id=1873 题目: The Fortified Forest Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 6421 Accepted: 1811 Description 阅读全文
posted @ 2017-02-04 17:38 weeping 阅读(222) 评论(0) 推荐(0) 编辑
摘要:地址:http://poj.org/problem?id=1113 题目: Wall Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 36064 Accepted: 12315 Description Once upon a ti 阅读全文
posted @ 2017-02-03 14:03 weeping 阅读(148) 评论(0) 推荐(0) 编辑