链接:http://poj.org/problem?id=2007
题目大意:无序给出凸包的顶点集,其中一个顶点有(0,0),现在要求你按照逆时针输出该凸包的顶点,从(0,0)开始。
思路:逆时针,从(0,0)开始遍历,逆时针按角度排序,再挨个输出#include<iostream>
#include<cmath>
#include<stdio.h>
#include<algorithm>
#define EPS 1e-8
using namespace std;
struct point { double x, y; };
point convex[50];
double cross(point p1, point p2, point q1, point q2)//叉积计算
{
return (q2.y - q1.y)*(p2.x - p1.x) - (q2.x - q1.x)*(p2.y - p1.y);
}
bool cmp(point a, point b)
{
point o;
o.x = o.y = 0;
return cross(o, b, o, a) < 0; //叉积判断
}
int main()
{
int cnt = 0;
while (scanf("%lf%lf", &convex[cnt].x, &convex[cnt].y) != EOF)
{
cnt++;
}
sort(convex + 1, convex + cnt, cmp);//按角排序 从小到大
for (int i = 0; i < cnt; i++)
cout << "(" << convex[i].x << "," << convex[i].y << ")" << endl;
return 0;
}