poj1696

题意：寻找逆时针螺旋线最多能连几个点，典型的贪心，每次都连最外面的点即可。

方法：每次找到一个当前点curp，除了第一次是对数组按纵坐标排序得出外，剩下的均按极角排序。效率为O(v2)

WA点：sqrt函数如果传int参数，在oj上会CE

代码：

#include <iostream> #include <cstring> #include <algorithm> #include <cstdio> #include <cmath> using namespace std; struct Point { int x,y; int index; }; Point curp; int Cross(const Point& o,const Point& a,const Point& b) { return (a.x-o.x)*(b.y - o.y) - (b.x - o.x)*(a.y - o.y); } bool CmpByY(const Point& a,const Point& b) { return a.y < b.y; } double dis(const Point& a,const Point & b) { return sqrt(double((a.x - b. x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y))); } bool CmpBYAngle(const Point& a,const Point& b) { int res = Cross(curp,a,b); if(res > 0) return true; else if(res < 0) return false; else { double dis1 = dis(a,curp); double dis2 = dis(b,curp); if(dis1 < dis2) return true; else return false; } } Point point[55]; int main(){ int M; cin >> M; int n; while(M--) { cin >> n; cout << n ; for(int i = 0; i < n; i++) { scanf("%d%d%d",&point[i].index,&point[i].x,&point[i].y); } sort(point,point+n,CmpByY); curp = point[0]; cout << " " << curp.index ; for(int i = 1; i < n; i++) { sort(point+i,point+n,CmpBYAngle); curp = point[i]; cout << " " << curp.index; } cout << endl; } return 0; }