这道题目没有直接给出一些点,而是给出了一个凹多边形,让求凸包。这让我误以为不用先根据极点排序了,可以直接scan...后来发现好多反例,还是老老实实来。
Graham‘s Scan 其实步骤不复杂:(1)选出最左下的点;(2)对剩下的点按极角排序;(3)按序进栈出栈。
第(3)步,判断进栈出栈的标准,其实就是判断线段的走向。其中第(2)和(3)步都要用到矢量积,也就是外积。
#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
typedef struct{
int x, y;
} POINT;
POINT ch[1000];
double dist(POINT a, POINT b){ //求两点间距离
return sqrt(pow(a.x - b.x, 2.0) + pow(a.y - b.y, 2.0));
}
int crossProduct(POINT o, POINT a, POINT b){ //求外积
return (a.x - o.x) * (b.y - o.y) - (b.x - o.x) * (a.y - o.y);
}
bool cmp_position(POINT a, POINT b){ //找到最左下的点
return a.y < b.y || (a.y == b.y && a.x < b.x);
}
bool cmp_angle(POINT a, POINT b){ //比较极角
int temp = crossProduct(ch[0], a, b);
if(temp == 0)
return (dist(a, ch[0]) < dist(b, ch[0]));
else
return temp > 0;
}
void print(POINT a[], int N){
for(int i = 0; i < N; i++)
cout << a[i].x << " " << a[i].y << endl;
}
int main(){
int P;
bool flag = true;
cin >> P;
while(P--){
int N;
cin >> N;
for(int i = 0; i < N; i++)
cin >> ch[i].x >> ch[i].y;
swap(ch[0], *min_element(ch, ch + N, cmp_position)); //找到最左下点
sort(ch + 1, ch + N, cmp_angle); //按极角排序
ch[N] = ch[0];
POINT s[1000];
int top = 2;
s[0] = ch[0];
s[1] = ch[1];
for(int i = 2; i <= N; i++){ //scan
while(top >= 2 && crossProduct(s[top - 2], s[top - 1], ch[i]) <= 0){
top--;
}
s[top++] = ch[i];
}
if(flag){
cout << P + 1 << endl;
flag = false;
}
cout << top << endl;
print(s, top);
if(P != 0){
cin >> N;
cout << N << endl;
}
}
}