POJ 1474 Video Surveillance(判断多边形是否有核)

判断多边形是否有核，利用半平面交即可。

直接套模板

#include <stdio.h>
#include <string.h>
const int INF=120000000;

struct Point
{
    int x, y;
}pt[150];

typedef struct Point Point;
bool turn_right[150];

int det(Point s1, Point t1, Point s2, Point t2)
{
    int d1x = t1.x-s1.x;
    int d1y = t1.y-s1.y;
    int d2x = t2.x-s2.x;
    int d2y = t2.y-s2.y;
    return d1x*d2y - d2x*d1y;
}

void Swap(int &a, int &b)
{
    if (a>b)
    {
        int t=a;
        a=b;
        b=t;
    }
}

int main ()
{
    int n, i, cross, maxx, minx, maxy, miny, maxn, minn, countn=0;
    while (scanf("%d", &n)==1&&n)
    {
        maxx=maxy=-INF;
        minx=miny=INF;
        //点按顺时针给出
        for (i=1; i<=n; i++)
        {
            scanf("%d %d", &pt[i].x, &pt[i].y);
            if (maxx<pt[i].x)
                maxx=pt[i].x;
            if (maxy<pt[i].y)
                maxy=pt[i].y;
            if (minx>pt[i].x)
                minx=pt[i].x;
            if (miny>pt[i].y)
            miny=pt[i].y;
        }
        pt[n+1]=pt[1];
        pt[n+2]=pt[2];
        pt[n+3]=pt[3];
        pt[n+4]=pt[4];
        //求每条线段的转向
        for (i=1; i<=n+1; i ++)
        {
            cross = det(pt[i],pt[i+1], pt[i+1], pt[i+2]);
            if (cross<0)
                turn_right[i+1]=true;
            else
                turn_right[i+1]=false;
        }
//两条边连续右转的为凸处，只有此时才可影响“核”肯恩存在的范围
        for (i=2; i<= n+1; i++)
            if (turn_right[i] && turn_right[i+1])
            {
                if (pt[i].x==pt[i+1].x)
                {
                    minn=pt[i].y;
                    maxn=pt[i+1].y;
                    Swap(minn, maxn);
                    if (minn>miny)
                        miny=minn;
                    if (maxn<maxy)
                        maxy=maxn;
                }
                else
                {
                    minn=pt[i].x;
                    maxn=pt[i+1].x;
                    Swap(minn, maxn);
                    if (minn>minx)
                        minx=minn;
                    if (maxn<maxx)
                        maxx=maxn;
                }
            }
            if (minx<=maxx && miny<=maxy)
                printf("Floor #%d\nSurveillance is possible.\n\n", ++countn);
            else
                printf("Floor #%d\nSurveillance is impossible.\n\n", ++countn);
        }
    return 0;
}