Qianyri的博客

洛谷P2742求凸包周长#include<bits/stdc++.h>using namespace std;const int MAX=1e4+1;const double eps=1e-8;struct point{ double x,y; point(){} point(double a,double b) { ...

HDU6354 Everything Has Changed求圆弧的周长#include<bits/stdc++.h>using namespace std;const int MAX=1e2+5;const double PI=3.14159265358979323846;const double eps=1e-8;struct point{ doubl...

T^TOJ 长方形的并的面积线段树维护[ 1 ,  n ]全区间大于0的节点的个数即为矩形的长度，线段之间的宽度即为矩形的宽度#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;const int MAX=1e3+5;struct node{...