大三ACM - 计算几何
Little_boy_z
这个作者很懒,什么都没留下…
展开
-
POJ - 1113 Wall 凸包周长
#include#include#include#includeusing namespace std;const int MAXN=1000;const double PI=acos(-1.0);struct point{ int x,y;};point list[MAXN];int stack[MAXN],top;int原创 2017-10-28 20:19:01 · 228 阅读 · 0 评论 -
New Year and Curling 计算几何
Carol is currently curling.She has n disks each with radius r on the 2D plane.Initially she has all these disks above the line y = 10100.She then will slide the disks towards the line y原创 2018-01-25 16:47:21 · 216 阅读 · 0 评论 -
POJ - 2074 Line of Sight 射线遮盖
An architect is very proud of his new home and wants to be sure it can be seen by people passing by his property line along the street. The property contains various trees, shrubs, hedges, and other o原创 2017-10-30 18:24:14 · 230 阅读 · 0 评论 -
POJ1584-A Round Peg in a Ground Hole
转载请注明出处:優YoU http://user.qzone.qq.com/289065406/blog/1309142308大致题意:按照顺时针或逆时针方向输入一个n边形的顶点坐标集,先判断这个n边形是否为凸包。再给定一个圆形(圆心坐标和半径),判断这个圆是否完全在n变形内部。 解题思路:题意已经很直白了。。就是那个思路。。。转载 2017-10-30 13:45:34 · 224 阅读 · 0 评论 -
POJ - 1039 Pipe
The GX Light Pipeline Company started to prepare bent pipes for the new transgalactic light pipeline. During the design phase of the new pipe shape the company ran into the problem of determining how原创 2017-10-30 12:50:52 · 480 阅读 · 0 评论 -
POJ - 1556 The Doors
You are to find the length of the shortest path through a chamber containing obstructing walls. The chamber will always have sides at x = 0, x = 10, y = 0, and y = 10. The initial and final points of原创 2017-10-29 18:08:26 · 216 阅读 · 0 评论 -
POJ - 1269 Intersecting Lines 两直线的位置关系
#include #include const double T = 1e-8;struct Node{ double x, y;}p1, p2, p3, p4;double ChaJi(Node a, Node b, Node c){ return (c.x-a.x)*(b.y-a.y)-(c.y-a.y)*(b.x-a.x);} void Sol原创 2017-10-29 13:22:27 · 257 阅读 · 0 评论 -
POJ - 2318 TOYS 二分+叉积
给出n条线段把一个区域分割成不同的地区,之后给你m个点,求每个地区有几个点。线段是从左到右给出的,所以不用做什么处理。对于每一个点我们直接二分,即可。#include#include#includeusing namespace std;struct point{int x,y;};struct Node{point a,b;}A[5010];原创 2017-10-29 12:23:50 · 242 阅读 · 0 评论 -
POJ - 1873 The Fortified Forest 二进制+凸包
Once upon a time, in a faraway land, there lived a king. This king owned a small collection of rare and valuable trees, which had been gathered by his ancestors on their travels. To protect his trees原创 2017-10-29 10:39:05 · 587 阅读 · 2 评论 -
Gym - 101606L Lizard Lounge 极坐标+最长公共子序列
https://blog.csdn.net/hao_zong_yin/article/details/79901343#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>#include <vector>#include <cmath&g...转载 2018-05-03 17:23:28 · 383 阅读 · 0 评论