Gipsy

https://vjudge.net/problem/HDU-1115直接找的模板抄上去了首先划分多个三角形然后算出每个三角形的质量和重心再然后就是高中物理竞赛的质心的算法AC代码：#include<bits/stdc++.h>using namespace std;typedef long long ll;/*==================================...

标准做法二维凸包+旋转卡壳但是满足凸性可以三分#include<bits/stdc++.h>using namespace std;typedef double db;const db eps = 1e-15, pi = acos(-1);int sign(db x) {return x < -eps ? -1 : x > eps;}int cmp(db...

可以写树状数组，这里直接写的线段树#include<bits/stdc++.h>using namespace std; const int N = 1e5 + 10;struct SegmentTree { int l, r, sum, f; #define l(x) Tree[x].l #define r(x) Tree[x].r #def...

#include<bits/stdc++.h>using namespace std;typedef double db;const db eps = 1e-15, pi = acos(-1);int sign(db x) {return x < -eps ? -1 : x > eps;}int cmp(db x, db y) {return sign(x - ...

#include<bits/stdc++.h>using namespace std;typedef double db;const db eps = 1e-15, pi = acos(-1);int sign(db x) {return x < -eps ? -1 : x > eps;}int cmp(db x, db y) {return sign(x - ...

#include<bits/stdc++.h>using namespace std;typedef double db;const db eps = 1e-15, pi = acos(-1);int sign(db x) {return x < -eps ? -1 : x > eps;}int cmp(db x, db y) {return sign(x - ...

沈阳赛区金牌题#include<bits/stdc++.h>using namespace std;typedef double db;const db eps = 1e-15, pi = acos(-1);int sign(db x) {return x < -eps ? -1 : x > eps;}int cmp(db x, db y) {return ...

#include<bits/stdc++.h>using namespace std;typedef double db;const db eps = 1e-15, pi = acos(-1);int sign(db x) {return x < -eps ? -1 : x > eps;}int cmp(db x, db y) {return sign(x - ...

#include<bits/stdc++.h>using namespace std;typedef double db;const db eps = 1e-12, pi = acos(-1);int sign(db x) {return x < -eps ? -1 : x > eps;}int cmp(db x, db y) {return sign(x - ...

#include<bits/stdc++.h>using namespace std;typedef double db;const db inf =1e9;const int N=1e5+10;struct Point{ db x,y; void input(){scanf("%lf%lf",&x,&y);} db dis(Poin...

#include<bits/stdc++.h>using namespace std;typedef double db;const db eps = 1e-12, pi = acos(-1);int sign(db x) {return x < -eps ? -1 : x > eps;}int cmp(db x, db y) {return sign(x - ...

先求投影，然后对称点，然后直线交点#include<bits/stdc++.h>using namespace std;typedef double db;const db eps=1e-8,pi=acos(-1);int sign(db x){if(x>eps)return 1;if(x<-eps)return -1;return 0;}int cmp(d...

#include<bits/stdc++.h>using namespace std;typedef double db;const db eps=1e-8;const db pi=acos(-1);int sign(db x){if(x>eps)return 1;if(x<-eps)return -1;return 0;}int cmp(db x,db y)...

#include<bits/stdc++.h>using namespace std;typedef double db;const db eps=1e-8;const db pi=acos(-1);int sign(db x){if(x>eps)return 1;if(x<-eps)return -1;return 0;}int cmp(db x,db y)...

计算几何//#include<bits/stdc++.h>#include<iostream>#include<cmath>#include<stdio.h>using namespace std;typedef double db;const db eps=1e-8;const db pi=acos(-1);int sign(...

将所有点的两两的中心处理出来，看哪个点被用的最多用哪个尊龙的代码~#include<bits/stdc++.h>using namespace std;struct point{ int x,y;} p[1010];struct { int x,y,cnt=-1;} ha[10000010];int num,n;long long h=1...