poj2007凸包graham逆时针输出

题意：给出一组点，包含原点，求凸包，并从原点开始按照逆时针方向输出

#include<iostream>
#include<algorithm>
#include<cmath>
#define MAX 1000
using namespace std;
struct points
{
	double x,y;
};
points p[MAX];
int n,l,res[MAX],top;
bool cmp(const points &a,const points &b)
{
	if(a.y==b.y)return a.x<b.x;
	return a.y<b.y;
	
}
bool mult(points sp,points ep,points op)
{
	return (sp.x-op.x)*(ep.y-op.y)>=(ep.x-op.x)*(sp.y-op.y);
}
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;
	}
}
int main()
{
	int s,i;
	n=0;
	while(scanf("%lf%lf",&p[n].x,&p[n].y)!=EOF)n++;
	graham(); 
	for(s=0;s<top;s++)
		if(!p[res[s]].x && ! p[res[s]].y)break;
	for(i=s;i<top;i++)
		printf("(%.lf,%.lf)\n",p[res[i]].x,p[res[i]].y);
	for(i=0;i<s;i++)
		printf("(%.lf,%.lf)\n",p[res[i]].x,p[res[i]].y);	
	system("pause");
	return 0;
}