Viva Confetti Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 761   Accepted: 319 Description Do you know confetti? They are small discs of colored paper, and people throw them around during parties or festivals. Since people throw lots…

http://poj.org/problem?id=2528 Description The citizens of Bytetown, AB, could not stand that the candidates in the mayoral election campaign have been placing their electoral posters at all places at their whim. The city council has finally decided…

来自这两篇博客的总结 http://blog.csdn.net/SunnyYoona/article/details/43938355 http://m.blog.csdn.net/blog/mr_zys/10226425 题目大意 如图所示,在一条水平线上有N个建筑物,建筑物都是长方形的,且可以互相遮盖.给出每个建筑物的左右坐标值Ai,Bi以及每个建筑物的高Hi,需要计算出这些建筑物总共覆盖的面积. 题目数据范围: 建筑物个数N:1 <= N <= 40000 建筑物左右坐标值Ai, Bi:…

Description The citizens of Bytetown, AB, could not stand that the candidates in the mayoral election campaign have been placing their electoral posters at all places at their whim. The city council has finally decided to build an electoral wall for…

Viva Confetti Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 1025   Accepted: 422 Description Do you know confetti? They are small discs of colored paper, and people throw them around during parties or festivals. Since people throw lots…

3675 -- Telescope 再来一题.这题的代码还是继续完全不看模板重写的. 题意不解释了,反正就是一个单纯的圆与多边形的交面积. 这题的精度有点搞笑.我用比较高的精度来统计面积,居然wa了.把精度降到1e-6瞬间过了. ——written by Lyon…

[题目链接] http://poj.org/problem?id=1981 [题目大意] 给出平面上一些点,问一个半径为1的圆最多可以覆盖几个点 [题解] 我们对于每个点画半径为1的圆,那么在两圆交弧上的点所画的圆,一定可以覆盖这两个点 我们对于每个点计算出其和其它点的交弧,对这些交弧计算起末位置对于圆心的极角, 对这些我们进行扫描线操作,统计最大交集数量就是答案. [代码] #include <cstdio> #include <algorithm> #include <c…

处理流程:快速二值化(区域)->获取区域边缘->截取边缘->膨胀边缘区域(定位)->定位区域进行边缘检测->边缘分割:线和圆->选择属性为圆的弧->拟合圆 *读取图像 read_image (Image, 'double_circle') dev_close_window () get_image_size (Image, Width, Height) dev_open_window (, , Width, Height, 'black', WindowHandl…

原文地址:http://hi.baidu.com/lj2tj/item/557d8d1a65adfa721009b58b ---------------------------------------------------------------------------------------------- Canvas 画圆 W3School中对Canvas的画圆方法的描述如下: 语法 arc(x, y, radius, startAngle, endAngle, counterclockw…

正规的做法是找切点.三角形三个顶点分别对圆作切线,然后求切点(2个).两圆之间也要求切点(4个). 扯淡了这就..麻烦的要命.. 下面是写了一半的代码.. void process_circle(point p, point o, double r, point &intersect1, point &intersect2) {     point vec;     vec = o - p;     double angle = asin(r*1.0 / sqrt(dist(p, o)))…