hdu 3662

题意：三维里一堆点里面找一个多边形包括所有点

思路：裸的三维凸包模板。网上的模板都是一样的，我把上交的ACM国际大学生程序设计竞赛上的三维凸包敲了一下，因为缺少必要的函数，所以一开始迟迟不过，后来套用了一些函数，就能过了，总得来说，上交写的模板不会是错的，这么厉害的学校不会犯这种错误的。附上代码

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
using namespace std;
const double eps = 1e-8;
inline double Sqr(double a)
{
    return a*a;
}
inline double Sqrt(double a)
{
    return a < 0?0:sqrt(a);
}
inline int Sign(double x)
{
    return x < -eps ?-1:(x > eps?1:0);
}
struct Point
{
    double x,y,z;
    Point() {}
    Point(double x,double y,double z):x(x),y(y),z(z) {}
    double Length()const
    {
        return Sqrt(Sqr(x)+Sqr(y)+Sqr(z));
    }
    bool operator == (const Point &a)const
    {
        return x == a.x&&y == a.y&&z == a.z;
    }
    bool operator <(const Point &a)const
    {
        if(x !=a.x) return x < a.x;
        if(y != a.y) return y < a.y;
        return z < a.z;
    }
    Point operator +(const Point&a)
    {
        return Point(a.x+x,a.y+y,a.z+z);
    }
    Point operator -(const Point &b)
    {
        return Point(x - b.x,y - b.y,z - b.z);
    }
    Point operator *(double b)
    {
        return Point(x*b,y*b,z*b);
    }
    Point operator /(double b)
    {
        return Point(x/b,y / b,z/b);
    }
    Point Unit()
    {
        return *this/Length();
    }
};
int mark[310][310];
Point info[410];
int n,cnt;
Point det(const Point &a,const Point &b)
{
    return Point(a.y*b.z - a.z*b.y,a.z*b.x - a.x*b.z,a.x*b.y - a.y*b.x);
}
double dot(const Point&a,const Point &b)
{
    return a.x*b.x+a.y*b.y+a.z*b.z;
}
double Mix(const Point &a,const Point &b,const Point &c)
{
    return dot(a,det(b,c));
}
double dis(const Point&a,const Point &b)
{
    return Sqrt(Sqr(a.x - b.x)+Sqr(a.y - b.y)+Sqr(a.z - b.z));
}
double area(int a,int b,int c)
{
    return det(info[b] - info[a],info[c] - info[a]).Length();
}
double volumn(int a,int b,int c,int d)
{
    return Mix(info[b] - info[a],info[c] - info[a],info[d] - info[a]);
}
struct Face
{
    int a,b,c;
    Face() {}
    Face(int a,int b,int c):a(a),b(b),c(c) {}
    int &operator [](int k)
    {
        if(k == 0)return a;
        if(k == 1) return b;
        if(k == 2) return c;
    }
};
vector<Face> face;
bool same(int s,int e)//判断两个面是否为同一面
{
    int a=face[s].a,b=face[s].b,c=face[s].c;
    return fabs(volumn(a,b,c,face[e].a))<eps
           &&fabs(volumn(a,b,c,face[e].b))<eps
           &&fabs(volumn(a,b,c,face[e].c))<eps;
}
inline void insert(int a,int b,int c)
{
    face.push_back(Face(a,b,c));
}

void add(int v)
{
    vector<Face> tmp;
    int a,b,c;
    cnt++;
    for(int i = 0; i < face.size(); i++)
    {
        a = face[i][0];
        b = face[i][1];
        c = face[i][2];
        if(Sign(volumn(v,a,b,c))<0)
        {
            mark[a][b] = mark[b][a] = mark[b][c] = mark[c][b] = mark[c][a] = mark[a][c] = cnt;
        }
        else
            tmp.push_back(face[i]);
    }
    face = tmp;
    for(int i = 0; i < tmp.size(); i++)
    {
        a = face[i][0];
        b = face[i][1];
        c = face[i][2];
        if(mark[a][b] == cnt) insert(b,a,v);
        if(mark[b][c] == cnt) insert(c,b,v);
        if(mark[c][a] == cnt) insert(a,c,v);
    }
}

int Find()
{
    for(int i = 2; i < n; i++)
    {
        Point ndir = det(info[0] - info[i],info[1] - info[i]);
        if(ndir == Point())continue;
        swap(info[i],info[2]);
        for(int j = i+1; j < n; j++)
        {
            if(Sign(volumn(0,1,2,j))!=0)
            {
                swap(info[j],info[3]);
                insert(0,1,2);
                insert(0,2,1);
                return 1;
            }
        }
    }
    return 0;
}
double D_convex()
{
    sort(info,info+n);
    n = unique(info,info+n) - info;
    face.clear();
    random_shuffle(info,info+n);
    if(Find())
    {
        memset(mark,0,sizeof(mark));
        cnt = 0;
        for(int i = 3; i < n; i++)add(i);
        int ans = 0;
        for(int i =0; i < face.size(); i++)
        {
            int j,k;
            for(j = 0,k = 1; j <i; j++)
            {
                if(same(i,j))
                {
                    k = 0;break;
                }
            }
            ans+=k;
        }
        printf("%d\n",ans);
//        double ans = 0;
//        for(int i = 0;i < face.size();i++)
//        {
//            Point p = det(info[face[i][0]] - info[face[i][1]],info[face[i][2]] - info[face[i][1]]);
//            ans+=p.Length();
//        }
//        return ans/2.;
    }
    return -1;//no solution
}
int main()
{
    while(scanf("%d",&n)!=EOF)
    {
        for(int i = 0; i < n; i++)
        {
            scanf("%lf%lf%lf",&info[i].x,&info[i].y,&info[i].z);
        }
        D_convex();
    }
    return 0;
}