凸包-极角序-水平序
// Graham算法, 极角序,复杂度O(nLog(n))
Point List[maxn];
int aStack[maxn],top;
bool cmp(Point p1,Point p2) {//极角序的排序规则
double temp = Xmult(List[0],p1,p2);
if(temp > 0) return true;
if(temp == 0 && Dis(List[0],p1) < Dis(List[0],p2)) return true;
return false;
}
void Init(int n) {//输入n个点并且排序
if(n == 0) return;
scanf("%lf%lf",&List[0].x,&List[0].y);
Point p0(List[0].x,List[0].y);
int k = 0;
for(int i = 1; i < n; i ++) {
scanf("%lf%lf",&List[i].x,&List[i].y);
if(p0.y > List[i].y || (p0.y == List[i].y && p0.x > List[i].x)) {
p0 = Point(List[i].x,List[i].y);
k = i;
}
}
List[k] = List[0];
List[0] = p0;
sort(List + 1,List + n,cmp);
}
void Graham(int n) {// Graham算法,aStack[]里面是凸包点集,区间[0,top],top可以取到
if(n == 1) {
aStack[0] = 0;
top = 0;
return;
}
top = 1;
aStack[0] = 0;
aStack[1] = 1;
if(n == 2) return;
for(int i = 2; i < n; i ++) {
while(top > 0 && Xmult(List[aStack[top - 1]],List[aStack[top]],List[i]) <= 0)
top --;//这里调用求叉积函数
top ++;
aStack[top] = i;
}
}
// Graham算法, 水平序,复杂度O(nLog(n))
int aStack[maxn],top;//aStack[]存的是凸包点集下标,区间范围[0,top)右区间端点不能取到
Point List[maxn];//List[]存的是输入的点集数组;
bool cmp(Point p1,Point p2) {//水平序排序规则
if(p1.x != p2.x) return p1.x < p2.x;
return p1.y < p2.y;
}
void Graham(int n) {//传入n,点集到输入List[]数组中在主函数中实现,这里只实现排序和求凸包
sort(List,List + n,cmp);
top = 0;
for(int i = 0; i < n; i ++) {
while(top > 1 && Xmult(List[aStack[top - 1]],List[i],List[aStack[top - 2]]) <= 0)
top --;
aStack[top ++] = i;
}
int k = top;
for(int i = n - 2; i >= 0; i --) {
while(top > k && Xmult(List[aStack[top - 1]],List[i],List[aStack[top - 2]]) <= 0)
top --;
aStack[top ++] = i;
}
if(n > 1) top --;
}