凸包求出来
求一个周长
特判一下只有一个点和一条边的情况。还有就是注意一下精度问题。
#include <bits/stdc++.h>
#include <iostream>
#include<algorithm>
#include <cstdio>
#include <cmath>
#define re register int
#define int long long
#define inf 0x3f
using namespace std;
const int N=1e2+5;
int n,top,ans;
struct Point{
int x,y;
}point[N],stk[N];
inline double dis(Point a,Point b)
{
return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}
int cross(Point a,Point b,Point c){
return (b.x-a.x)*(c.y-a.y)-(c.x-a.x)*(b.y-a.y);
}
void find_miny(){
Point tmp=point[0];
int flag=0;
for(int i=1;i<n;i++){
if(point[i].y<tmp.y||(point[i].y==tmp.y&&point[i].x<tmp.x)){
tmp=point[i];
flag=i;
}
}
if(flag) swap(point[0],point[flag]);
}
bool cmp(Point a,Point b){
int n=cross(point[0],a,b);
if(n>0||(n==0&&dis(point[0],a)>dis(point[0],b))) return true;
return false;
}
void Graham(){
top=-1;
stk[++top]=point[0]; stk[++top]=point[1];
for(int i=2;i<n;i++){
while(top&&cross(stk[top-1],stk[top],point[i])<0) top--;
stk[++top]=point[i];
}
}
void solve()
{
top=0;
memset(stk,0,sizeof(stk));
memset(point,0,sizeof(point));
for(int i=0;i<n;i++){
cin>>point[i].x>>point[i].y;
}
find_miny();
sort(point+1,point+n,cmp);
Graham();
stk[++top]=point[0];
double fans=0;
for(int i=0;i<top;i++)
{
fans+=dis(stk[i],stk[i+1]);
}
if(n==1)
{
cout<<0<<endl;
return;
}
if(top==2)
{
printf("%.2lf\n",fans/2);
return;
}
printf("%.2lf\n",fans);
}
signed main() {
while(1)
{
cin>>n;
if(!n)break;
solve();
}
return 0;
}