POJ 1696 Space Ant <计算几何>

题目

水题。。

代码：

#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;

const int EPS=1e-8;
const int MAXN=55;

struct Point;
typedef Point Vec;

struct Point{
    int id,order;
    double x,y;
    Point(){}
    Point(int xx,int yy):x(xx),y(yy){}
    Vec operator -(Point p){
        return Point(x-p.x,y-p.y);
    }
    double operator ^(Vec v){
        return x*v.y-y*v.x;
    }
    bool operator <(Point& p){
        return order<p.order;
    }
    double dist(){
        return sqrt(x*x+y*y);
    }
};

int n;
Point p[MAXN];

int dblcmp(double x){
    return fabs(x)<EPS?0:(x>0?1:-1);
}


void dfs(int pre,int dep){
    if(dep==n) return ;
    int now=-1;
    while(p[++now].order!=-1);
    for(int i=now+1;i<n;++i){
        if(p[i].order!=-1) continue;
        if(dblcmp((p[now]-p[pre])^(p[i]-p[pre]))==-1) now=i;
        else if(dblcmp((p[now]-p[pre])^(p[i]-p[pre]))==0&&(p[i]-p[pre]).dist()<(p[now]-p[pre]).dist())
            now=i;
    }
    p[now].order=dep;
    dfs(now,dep+1);
}

int main(){
    ios::sync_with_stdio(false);
    int m;
    cin>>m;
    while(m--){
        cin>>n;
        int start=0;
        for(int i=0;i<n;++i){
            cin>>p[i].id>>p[i].x>>p[i].y;
            p[i].order=-1;
            if(p[start].y>p[i].y) start=i;
        }
        p[start].order=0;
        dfs(start,1);
        sort(p,p+n);
        cout<<n;
        for(int i=0;i<n;++i){
            cout<<' '<<p[i].id;
        }
        cout<<endl;
    }
    return 0;
}