随笔分类 -  ACM—几何

线段相交
摘要：1 #include 2 #include 3 #include 4 #include 5 using namespace std; 6 struct point 7 { 8 double x,y; 9 };10 point p[4];11 int kuai()12 {13 if(mi... 阅读全文
posted @ 2015-09-17 21:08 御心飞行 阅读(258) 评论(0) 推荐(0)
凸包(hd1392)
摘要：Surround the TreesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8996Accepted Submission(s): 3457... 阅读全文
posted @ 2015-09-16 21:23 御心飞行 阅读(158) 评论(0) 推荐(0)
折线分割平面（递推）
摘要：折线分割平面Problem Description我们看到过很多直线分割平面的题目，今天的这个题目稍微有些变化，我们要求的是n条折线分割平面的最大数目。比如，一条折线可以将平面分成两部分，两条折线最多可以将平面分成7部分，具体如下所示。Input输入数据的第一行是一个整数C,表示测试实例的个数，然后... 阅读全文
posted @ 2015-06-03 22:23 御心飞行 阅读(251) 评论(0) 推荐(0)
Lifting the Stone（hdoj1115）
摘要：Lifting the StoneTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6104Accepted Submission(s): 2546P... 阅读全文
posted @ 2015-05-30 23:02 御心飞行 阅读(208) 评论(0) 推荐(0)
you can Solve a Geometry Problem too（hdoj1086）
摘要：Problem DescriptionMany geometry（几何）problems were designed in the ACM/ICPC. And now, I also prepare a geometry problem for this final exam. According ... 阅读全文
posted @ 2015-05-21 18:35 御心飞行 阅读(146) 评论(0) 推荐(0)
Computer Transformation(hdoj 1041)
摘要：Problem DescriptionA sequence consisting of one digit, the number 1 is initially written into a computer. At each successive time step, the computer s... 阅读全文
posted @ 2015-05-18 17:21 御心飞行 阅读(200) 评论(0) 推荐(0)