POJ 1228 Grandpa's Estate

求一遍规范凸包（不包括线段非端点的点）和一遍非规范凸包（包含点段非端点的点），如果形状一样，则原图就是这个样子。

假设原图不为这个样子，如右图，即存在A点，则明显构成的就不是凸包了……

#include <algorithm>
#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>

#include <map>
#include <set>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <string>
#include <bitset>
#include <memory>
#include <complex>
#include <numeric>

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <time.h>
#include <ctype.h>
#include <locale.h>

using namespace std;

#pragma pack(4)

const double  eps = 1e-8;
const double   pi = acos(-1.0);
const int     inf = 0x7f7f7f7f;

#define loop(a,n)                            \
    for(int i=0;n>i;i++)                     \
        cout<<a[i]<<(i!=n-1?' ':'\n')
#define loop2(a,n,m)                         \
    for(int i=0;n>i;i++)                     \
        for(int j=0;m>j;j++)                 \
            cout<<a[i][j]<<(j!=m-1?' ':'\n')

#define   at(a,i) ((a)&(1<<(i)))
#define   nt(a,i) ((a)^(1<<(i)))
#define set1(a,i) ((a)|(1<<(i)))
#define set0(a,i) ((a)&(~(1<<(i))))

#define cmp(a,b) (fabs((a)-(b))<eps?0:(((a)-(b))>eps?+1:-1))

#define lmax(a,b) ((a)>(b)?(a):(b))
#define lmin(a,b) ((a)<(b)?(a):(b))
#define fmax(a,b) (cmp(a,b)>0?(a):(b))
#define fmin(a,b) (cmp(a,b)<0?(a):(b))

const int MAXV = 1002;

typedef struct Point
{
    double c[2];
    Point(double x=0,double y=0)
    {
        c[0]=x;
        c[1]=y;
    }
    double & operator [] (int i)
    {
        return c[i];
    }
    Point operator - (Point argu)
    {
        return Point(c[0]-argu[0],c[1]-argu[1]);
    }
    bool operator < (Point argu) const
    {
        if(cmp(c[0],argu[0])==0) return cmp(c[1],argu[1])<0;
        else return cmp(c[0],argu[0])<0;
    }
    bool operator != (Point argu) const
    {
        return (cmp(c[0],argu[0])!=0)||(cmp(c[1],argu[1])!=0);
    }
    friend ostream & operator << (ostream & cout,Point argu)
    {
        return printf("(%g,%g)",argu[0],argu[1]),cout;
    }
}Vector;

double cross(Vector a,Vector b)
{
    return a[0]*b[1]-a[1]*b[0];
}
double cross(Point o,Point a,Point b)
{
    return cross(a-o,b-o);
}
int side(Point p,Point s,Point e)
{
    return cmp(cross(s,e,p),0);
}

Point convex[MAXV];

int convexHull(Point poly[],int n)
{
    int cnt=0,ans=0;
    sort(poly,poly+n);
    for(int i=0;n>i;i++)
    {
        while(cnt>=ans+2&&side(poly[i],convex[cnt-2],convex[cnt-1])<=0)
            cnt--;
        convex[cnt++]=poly[i];
    }
    ans=cnt-1;
    for(int i=n-2;i>=0;i--)
    {
        while(cnt>=ans+2&&side(poly[i],convex[cnt-2],convex[cnt-1])<=0)
            cnt--;
        convex[cnt++]=poly[i];
    }
    return cnt-1;
}
bool findAns(Point convex[],int n,Point poly[],int m)
{
    if(n<3) return false;
    for(int i=0;n>i;i++)
    {
        bool flag=false;
        for(int j=0;m>j;j++)
        {
            if(poly[j]!=convex[i]&&poly[j]!=convex[(i+1)%n])
            {
                if(side(poly[j],convex[i],convex[(i+1)%n])==0)
                {
                    flag=true;
                    break;
                }
            }
        }
        if(!flag) return false;
    }
    return true;
}

int tcase,n;
Point a[MAXV];

int main()
{
    #ifndef ONLINE_JUDGE
    freopen("Grandpa's Estate.txt","r",stdin);
    #endif

    scanf("%d",&tcase);while(tcase--)
    {
        scanf("%d",&n);
        for(int i=0;n>i;i++)
        {
            scanf("%lf %lf",&a[i][0],&a[i][1]);
        }
        printf("%s\n",findAns(convex,convexHull(a,n),a,n)?"YES":"NO");
    }

    return 0;
}