Haipai1998的博客

Area2 HDU - 3060题意: 求任意两多边形的交,可能是凹的思路:把顶点数为n,m的多边形切割成n-2个三角形和m-2个三角形.每两两求面积交如果两面积方向相同: 都为正,代表凸重叠；都为负,代表是两个凹重叠；  总面积减去交面积面积方向不相同就相加#include<cstdio>#include<vector>#include<c...

Rotating Scoreboard POJ - 3335注意,点逆时针输入#include<cstdio>#include<vector>#include<cmath>#include<string>#include<string.h>#include<iostream>#include<alg...

How I Mathematician Wonder What You Are! POJ - 3130 注意输入点的顺序,这题已经是逆时针#include<cstdio>#include<vector>#include<cmath>#include<string>#include<string.h>#include&l...

Most Distant Point from the Sea POJ - 3525 题意: 求点到多边形的最远距离思路: 用半平面交,求凸多边形的最大内切圆半径,二分r#include<cstdio>#include<vector>#include<cmath>#include<string>#include<strin...

C - Video Surveillance POJ - 1474#include<cstdio>#include<vector>#include<cmath>#include<string>#include<string.h>#include<iostream>#include<algorithm&g

Art Gallery POJ - 1279思路:求出核,再求多边形面积#include<cstdio>#include<vector>#include<cmath>#include<string>#include<string.h>#include<iostream>#include<algori...

Feng Shui POJ - 3384题意:n个顶点的凸包,放入2个半径为r的圆,可以重叠,要求面积最大,输出2个圆的圆心坐标(保留4位小数)思路:找出圆心的可行域(内推r,求半平面交),再求核内最远的2个点坐标#include<cstdio>#include<vector>#include<cmath>#include<string...

1.半平面交,板子点逆时针输入2.基本操作: 判断一个多边形核是否存在,面积2.半平面交,求凸多边形最大内切圆,内推r直到不存在内核3.半平面交,放入两个半径都为R的圆,求覆盖面积最大,不得超出多边形. 在2的基础上内推R求出圆心的可行域,再求距离最远的两个点4.关于半平面求解不等式,未完待续模板https://blog.youkuaiyun.com/Haipai1998/articl...