凸包问题
算法几何问题
point 存点信息,
cross 叉乘函数:可以排列点的顺序;也可以计算面积;
dis函数,计算两点之间线段长,在排序时计算优先级;
ans函数,利用栈来一个个排除选择最外部的点并得到最终的点序列
注意事项在代码中标注:
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#define MAXN 100010
#define MAXV 1e9
using namespace std;
struct points{
double x;
double y;
}point[MAXN];
void sort_point();
void ans();
void count_L();
void count_S();
double cross(const points p1, const points p2,const points p0);
double dis(const points A,const points B);
bool cmp(const points &a,const points &b){
double temp=cross(a,b,point[0]);
if(temp>0||(temp==0&&dis(a,point[0])<dis(b,point[0])))//注意在排序时,如果两点与设点最低点共线时应从短到长,这样在ans函数运算时就可以直接将短的点弹出栈外;
return 1;
return 0;
}
int N,top,min_i;
double min_y=MAXV;
int queue_p[MAXN];
int main(){
scanf("%d",&N);
for(int i=0;i<N;i++){
scanf("%lf%lf",&point[i].x,&point[i].y);
if((point[i].y<min_y)||((point[i].y==point[min_i].y)&&(point[i].x<point[min_i].x))){
min_y=point[i].y;
min_i=i;
}
}
sort_point();
ans();
count_L();
count_S();
return 1;
}
double cross(const points p1, const points p2,const points p0){//注意各个点的位置
return (p1.x-p0.x)*(p2.y-p0.y)-(p2.x-p0.x)*(p1.y-p0.y);
}
double dis(const points A,const points B){
return sqrt((A.x-B.x)*(A.x-B.x)+(A.y-B.y)*(A.y-B.y));
}
void count_L(){
double ans=0;
for(int i=1;i<=top;i++){
ans+=dis(point[queue_p[i-1]],point[queue_p[i]]);
}
printf("%.2f ",ans);
}
void count_S(){
double ans=0;
for(int i=1;i<top-1;i++){
ans+=fabs(cross(point[queue_p[i]],point[queue_p[i+1]],point[0]));
}
printf("%.2f\n",ans/2);
}
void sort_point(){
swap(point[0],point[min_i]);
sort(point+1,point+N,cmp);
/*for(int i=0;i<N;i++){
printf("%.0f %.0f ||",point[i].x,point[i].y);
}
printf("\n");*/
}
void ans(){
top=-1;
queue_p[++top]=0;
queue_p[++top]=1;
queue_p[++top]=2;
for(int i=3;i<N;i++){
double temp=cross(point[queue_p[top]],point[i],point[queue_p[top-1]]);
while(top&&temp<=0){
top--;
temp=cross(point[queue_p[top]],point[i],point[queue_p[top-1]]);
}
queue_p[++top]=i;
}
queue_p[++top]=0;
/*for(int i=0;i<=top;i++){
printf("%.0f %.0f ||",point[queue_p[i]].x,point[queue_p[i]].y);
}
printf("\n");*/
}