twh233的算法blog

Description 　　在xoy直角坐标平面上有n条直线L1,L2,...Ln,若在y值为正无穷大处往下看,能见到Li的某个子线段,则称Li为可见的,否则Li为被覆盖的. 　　例如,对于直线:L1:y=x; L2:y=-x; L3:y=0 　　则L1和L2是可见的,L3是被覆盖的. 　　给出n条直线,表示成y=Ax+B的形式(|A|,|B| Input

/* HDU 4273 Rescue 给一个三维凸包，求重心到表面的最短距离 模板题：三维凸包+多边形重心+点面距离 */ #include #include #include #include #include using namespace std; const int MAXN=550; const double eps=1e-8; struct Point { double x

POJ - 1113 Once upon a time there was a greedy King who ordered his chief Architect to build a wall around the King's castle. The King was so greedy, that he would not listen to his Architect's p