几何
文章平均质量分 73
zjck1995
这个作者很懒,什么都没留下…
展开
-
hdu5120 两圆环相交 数学题
公式 A大B大-A大B小-A小B大+A小B小#pragma comment(linker, "/STACK:102400000,102400000")#include #include#include#include#include#include#include#include#include#define lson l,m,rt<<1#define rson m+1原创 2015-08-08 00:00:13 · 369 阅读 · 0 评论 -
bzoj1069 凸包+旋转卡壳
问题:在若干个点中取四个点,求围成的四边形的最大面积。 思路:先求个凸包,n^2 枚举对角线,然后旋转卡壳O(1) 更新左右边界即可。#include <stdio.h>#include <string.h>#include <iostream>#include <algorithm>#include <vector>#include <queue>#include <set>#in原创 2016-10-26 13:21:44 · 458 阅读 · 0 评论 -
codeforces #339 div1 A 扫雪面积
#include#include#include#include#include#include#include#include using namespace std;const int N=1e5+10;#define mp make_pairtypedef pair PII;const int INF=1e9;struct Point{ double x,y;原创 2016-01-18 11:32:02 · 366 阅读 · 0 评论 -
计算几何模板(自己整理)
int sgn(double x){return x<-eps?-1:x<eps?0:1;}struct Point{ double x,y; Point(){} Point(double _x,double _y){ x=_x;y=_y; }};struct Seg{ Point s,e; Seg(){} Seg(Po原创 2015-10-15 12:42:42 · 340 阅读 · 0 评论 -
poj1584 凸包判断及与圆的相交
#include#include#include#include#include#include#include#includeusing namespace std;#define rd(x) scanf("%d",&x)#define rdd(x,y) scanf("%d%d",&x,&y)#define rddd(x,y,z) scanf("%d%d%d",&x,&y,原创 2015-09-24 16:44:20 · 413 阅读 · 0 评论 -
poj3449 多边形的相交问题,输入输出比较麻烦
#include#include#include#include#include#include#include#includeusing namespace std;#define rd(x) scanf("%d",&x)#define rdd(x,y) scanf("%d%d",&x,&y)#define rddd(x,y,z) scanf("%d%d%d",&x,&y,原创 2015-09-24 12:37:09 · 332 阅读 · 0 评论 -
poj管道光线的最远距离
#include#include#include#include#include#include#include#includeusing namespace std;#define rd(x) scanf("%d",&x)#define rdd(x,y) scanf("%d%d",&x,&y)#define rddd(x,y,z) scanf("%d%原创 2015-09-24 08:25:08 · 319 阅读 · 0 评论 -
hdu 3347 坐标系扩大根号2倍+暴力
#include#include#include#include#include#include#include#includeusing namespace std;#define rd(x) scanf("%d",&x)#define rdd(x,y) scanf("%d%d",&x,&y)#define rddd(x,y,z) scanf("%d%d%d",&x,&y,原创 2015-09-22 20:50:47 · 311 阅读 · 0 评论 -
poj1696 凸包
#include#include#include#include#include#include#include#includeusing namespace std;#define rd(x) scanf("%d",&x)#define rdd(x,y) scanf("%d%d",&x,&y)#define rddd(x,y,z) scanf("%d%d%d",&x,&y,原创 2015-09-22 17:33:00 · 343 阅读 · 0 评论 -
poj 2826 一道神奇的水题,死活都过不了,等以后再看吧
#include#include#include#include#include#include#include#includeusing namespace std;#define rd(x) scanf("%d",&x)#define rdd(x,y) scanf("%d%d",&x,&y)#define rddd(x,y,z) scanf("%d%d%d",&x,&y,原创 2015-09-22 23:04:36 · 375 阅读 · 0 评论 -
poj 1873 final 水题 位枚举凸包
题意:有n棵树,每棵树有坐标,价值,和用作篱笆的长度,求选择几棵树做篱笆后,围住剩下的树的总价值最高的方案,如果相同价值,就取用做篱笆的树最少的一种#include#include#include#include#include#include#include#includeusing namespace std;#define rd(x) scanf("%d",&x)#d原创 2015-10-11 11:24:14 · 333 阅读 · 0 评论 -
poj2653 线段相交+滚动数组更新结果
#include#include#include#include#include#include#include#includeusing namespace std;#define rd(x) scanf("%d",&x)#define rdd(x,y) scanf("%d%d",&x,&y)#define rddd(x,y,z) scanf("%d%d%d",&x,&y,原创 2015-09-21 21:32:38 · 305 阅读 · 0 评论 -
poj1066 线段求交 改了些判断条件就莫名其妙地过了
#include#include#include#include#include#include#include#includeusing namespace std;#define rd(x) scanf("%d",&x)#define rdd(x,y) scanf("%d%d",&x,&y)#define rddd(x,y,z) scanf("%d%d%d",&x,&y,原创 2015-09-22 09:21:57 · 382 阅读 · 0 评论 -
poj1556 判断线段相交+最短路
#include#include#include#include#include#include#include#includeusing namespace std;#define rd(x) scanf("%d",&x)#define rdd(x,y) scanf("%d%d",&x,&y)#define rddd(x,y,z) scanf("%d%d%d",&x,&y,原创 2015-09-21 20:06:05 · 299 阅读 · 0 评论 -
poj3304 判断是否存在一条直线经过n条线段
枚举两条线段的端点即可#include#include#include#include#include#include#includeusing namespace std;#define rd(x) scanf("%d",&x)#define rdd(x,y) scanf("%d%d",&x,&y)#define rddd(x,y,z) scanf("%d%d%d",&x原创 2015-09-21 08:58:22 · 370 阅读 · 0 评论 -
hdu2398 叉积+二分法
#include#include#include#include#include#include#includeusing namespace std;#define rd(x) scanf("%d",&x)#define rdd(x,y) scanf("%d%d",&x,&y)#define rddd(x,y,z) scanf("%d%d%d",&x,&y,&z)#defi原创 2015-09-20 23:25:15 · 372 阅读 · 0 评论 -
poj1113 凸包入门题
计算凸包周长和一个圆的周长#include#include#include#include#include#include#include#includeusing namespace std;#define rd(x) scanf("%d",&x)#define rdd(x,y) scanf("%d%d",&x,&y)#define rddd(x,y,z) scanf(原创 2015-10-08 23:26:31 · 504 阅读 · 0 评论 -
poj2074 线段相交的视线问题
求出每个阻碍物的线段上挡住的区间,然后求出剩下的区域中最长的那一段,这里可以利用-1 +1的思想,具体看代码吧#include#include#include#include#include#include#include#includeusing namespace std;#define rd(x) scanf("%d",&x)#define rdd(x,y) scan原创 2015-09-28 10:11:08 · 643 阅读 · 0 评论 -
最小矩形覆盖(凸包旋转卡壳)
#include<bits/stdc++.h>using namespace std;const double esp = 1e-6;int sgn(double x){return x<-esp?-1:x>esp;}const int N = 5e4+10;int n;struct Point{ double x,y; void in(){scanf("%lf%lf",原创 2016-10-19 15:43:45 · 558 阅读 · 0 评论