浩哥告诉说要用atan扫点而且只用扫描一遍就好了
我用两都扫的方法不知道为什么错了好多次,求高手指教!!
下面是我用tan排序ac的代码
#include<iostream>
#include<algorithm>
#include<cmath>
#define MAX 1000
#define eps 1e-12
using namespace std;
struct points
{
double x,y;
double atan;
};
points p[MAX],res[MAX];
int n,l,top;
double mult(points sp,points ep,points op)
{
return (sp.x-op.x)*(ep.y-op.y)>=(ep.x-op.x)*(sp.y-op.y);
}
bool ral(points p1,points p2,points p3)
{
return (p3.x-p1.x)*(p2.y-p1.y)>=(p2.x-p1.x)*(p3.y-p1.y);
}
bool cmp(const points &a,const points &b)
{
if(a.y-b.y==eps||a.y-b.y==0)return a.x-b.x<eps;
return a.y-b.y<eps;
/* return a.y<b.y||(a.y==b.y&&a.x<b.x);*/
}
int cmp2(points a,points b)
{
return a.atan<b.atan || ( a.atan==b.atan && a.x<b.x );
}
void graham()
{
int i,len;
top=1;
sort(p,p+n,cmp);
/**/
p[0].atan=0;
for (int i=1;i<n;i++)
p[i].atan=atan2(p[i].y-p[0].y,p[i].x-p[0].x);
sort(p,p+n,cmp2);
/**/
/*
if(n==0)return; res[0]=0;
if(n==1)return; res[1]=1;
if(n==2)return; res[2]=2;*/
res[0]=p[0];
res[1]=p[1];
for(i=2;i<n;i++)
{
while(top && ral(res[top-1],res[top],p[i]))
top--;
res[++top]=p[i];
}
/*if(top>2 && ral(res[top-1],res[top],p[i]))
top--;
len=top;
res[++top]=n-2;
for(i=n-3;i>=0;i--)
{
while(top != len && mult(p[i],p[res[top]],p[res[top-1]]))
top--;
res[++top]=i;
}*/
}
double dists(points aa,points bb)
{
return sqrt((aa.x-bb.x)*(aa.x-bb.x)+(aa.y-bb.y)*(aa.y-bb.y));
}
int main()
{
while(scanf("%d",&n)!=EOF && n)
{
for(int i=0;i<n;i++)
scanf("%lf%lf",&p[i].x,&p[i].y);
if(n<2)printf("0.00\n");
else
if(n==2)printf("%.2lf\n",dists(p[0],p[1]));
else
{
graham();
double re=0.0;
/*for(int i=0;i<=top;i++)
cout<<res[i].x<<" "<<res[i].y<<endl;*/
for(int i=0;i<=top;i++)
re+=dists(res[i],res[(i+1)%(top+1)]);
printf("%.2lf\n",re);
}
}
return 0;
}
附上未ac的两头扫的。求大牛神人指教,感激不尽
#include<iostream>
#include<algorithm>
#include<cmath>
#define MAX 1000
#define eps 1e-9
using namespace std;
struct points
{
double x,y;
};
points p[MAX];
int n,l,res[MAX],top;
double mult(points sp,points ep,points op)
{
return (sp.x-op.x)*(ep.y-op.y)>=(ep.x-op.x)*(sp.y-op.y);
}
bool cmp(const points &a,const points &b)
{
if(a.y-b.y==eps)return a.x-b.x<eps;
return a.y-b.y<eps;
}
void graham()
{
int i,len;
top=1;
sort(p,p+n,cmp);
if(n==0)return; res[0]=0;
if(n==1)return; res[1]=1;
if(n==2)return; res[2]=2;
for(i=2;i<n;i++)
{
while(top && mult(p[i],p[res[top]],p[res[top-1]]))
top--;
res[++top]=i;
}
len=top;
res[++top]=n-2;
for(i=n-3;i>=0;i--)
{
while(top!=len && mult(p[i],p[res[top]],p[res[top-1]]))
top--;
res[++top]=i;
}
}
double dists(points aa,points bb)
{
return sqrt((aa.x-bb.x)*(aa.x-bb.x)+(aa.y-bb.y)*(aa.y-bb.y));
}
int main()
{
while(scanf("%d",&n)!=EOF && n)
{
memset(p,0,sizeof(p));
memset(res,0,sizeof(res));
{
for(int i=0;i<n;i++)
scanf("%lf%lf",&p[i].x,&p[i].y);
if(n<2)printf("0.00\n");
else
if(n==2)printf("%.2lf\n",dists(p[0],p[1]));
else
{
graham();
double re;
/* for(int i=0;i<top;i++)
{
cout<<"..."<<p[res[i]].x<<" "<<p[res[i]].y<<endl;
}*/
for(int i=0;i<top;i++)
re+=dists(p[res[i]],p[res[(i+1)%(top+1)]]);
printf("%.2lf\n",re);
}
}
}
return 0;
}