旋转卡壳+半平面交板子 poj 2079

SampleInput

编辑

3
3 4
2 6
2 7
5
2 6
3 9
2 0
8 0
6 5
-1

SampleOutput

编辑

0.50
27.00

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <vector>
#include <iostream>
#include <string>
#include <map>
#include <stack>
#include <cstring>
#include <queue>
#include <list>
#include <stdio.h>
#include <set>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <iomanip>
#include <cctype>
#include <sstream>
#include <functional>
#include <stdlib.h>
#include <time.h>
#include <bitset>
#define eps 1e-8
using namespace std;
const int MAXN=2e3+5;
int m;
double r;
int cCnt,curCnt;//此时cCnt为最终切割得到的多边形的顶点数、暂存顶点个数
struct point
{
    double x,y;
    point(){}
    point(double _x,double _y):x(_x),y(_y){}
    void input()
    {
        scanf("%lf%lf",&x,&y);
    }
};
point points[MAXN],p[MAXN],q[MAXN];//读入的多边形的顶点（顺时针）、p为存放最终切割得到的多边形顶点的数组、暂存核的顶点
void getline(point x,point y,double &a,double &b,double &c)
{//两点x、y确定一条直线a、b、c为其系数
    a = y.y - x.y;
    b = x.x - y.x;
    c = y.x * x.y - x.x * y.y;
}
void initial()
{
    for(int i = 1; i <= m; ++i)p[i] = points[i];
    p[m+1] = p[1];
    p[0] = p[m];
    cCnt = m;//cCnt为最终切割得到的多边形的顶点数，将其初始化为多边形的顶点的个数
}
point intersect(point x,point y,double a,double b,double c)
{//求x、y形成的直线与已知直线a、b、c、的交点
    double u = fabs(a * x.x + b * x.y + c);
    double v = fabs(a * y.x + b * y.y + c);
    point pt;
    pt.x=(x.x * v + y.x * u) / (u + v);
    pt.y=(x.y * v + y.y * u) / (u + v);
    return pt;
}
void cut(double a,double b,double c)
{
    curCnt = 0;
    for(int i = 1; i <= cCnt; ++i)
    {
        if(a*p[i].x + b*p[i].y + c >= 0)q[++curCnt] = p[i];// c由于精度问题，可能会偏小，所以有些点本应在右侧而没在，
        //故应该接着判断
        else
        {
            if(a*p[i-1].x + b*p[i-1].y + c > 0)
            {//如果p[i-1]在直线的右侧的话，
                //则将p[i],p[i-1]形成的直线与已知直线的交点作为核的一个顶点(这样的话，由于精度的问题，核的面积可能会有所减少)
                q[++curCnt] = intersect(p[i],p[i-1],a,b,c);
            }
            if(a*p[i+1].x + b*p[i+1].y + c > 0)
            {//原理同上
                q[++curCnt] = intersect(p[i],p[i+1],a,b,c);
            }
        }
    }
    for(int i = 1; i <= curCnt; ++i)p[i] = q[i];//将q中暂存的核的顶点转移到p中
    p[curCnt+1] = q[1];p[0] = p[curCnt];
    cCnt = curCnt;
}
void solve()
{
  //注意：默认点是顺时针，如果题目不是顺时针，规整化方向
    initial();
    for(int i = 1; i <= m; ++i)
    {
        double a,b,c;
        getline(points[i],points[i+1],a,b,c);
        cut(a,b,c);
    }
  /*
    如果要向内推进r，用该部分代替上个函数
    for(int i = 1; i <= m; ++i)
    {
        Point ta, tb, tt;
        tt.x = points[i+1].y - points[i].y;
        tt.y = points[i].x - points[i+1].x;
        double k = r / sqrt(tt.x * tt.x + tt.y * tt.y);
        tt.x = tt.x * k;
        tt.y = tt.y * k;
        ta.x = points[i].x + tt.x;
        ta.y = points[i].y + tt.y;
        tb.x = points[i+1].x + tt.x;
        tb.y = points[i+1].y + tt.y;
        double a,b,c;
        getline(ta,tb,a,b,c);
        cut(a,b,c);
    }
    for(int i = 1; i <= cCnt; ++i)
    {
        for(int j = i + 1; j <= cCnt; ++j)
        {
            double tmp = pdis(p[i],p[j]);
            if(tmp > res){
                res = tmp;
                ansx = i;
                ansy = j;
            }
        }
    }
    printf("%.4lf %.4lf %.4lf %.4lf/n",p[ansx].x,p[ansx].y,p[ansy].x,p[ansy].y);  */
    //多边形核的面积
    double area = 0;
    for(int i = 1; i <= curCnt; ++i)
        area += p[i].x * p[i + 1].y - p[i + 1].x * p[i].y;
    area = fabs(area / 2.0);
    printf("%.2f\n",area);
}
inline void GuiZhengHua()
{
     //规整化方向，逆时针变顺时针，顺时针变逆时针
    for(int i = 1; i < (m+1)/2; i ++)
      swap(points[i], points[m-i]);//头文件加iostream
}
inline void init()
{
     for(int i = 1; i <= m; ++i)points[i].input();
        points[m+1] = points[1];
}

int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        cin>>m;
        init();
       // GuiZhengHua();
        solve();
    }
}

//china no.1
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <vector>
#include <iostream>
#include <string>
#include <map>
#include <stack>
#include <cstring>
#include <queue>
#include <list>
#include <stdio.h>
#include <set>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <iomanip>
#include <cctype>
#include <sstream>
#include <functional>
#include <stdlib.h>
#include <time.h>
#include <bitset>
using namespace std;
template<class T>inline T max(T a,T b,T c) { return max(max(a,b),c);}
#define EPS 1e-12
#define LL long long
#define max(a,b) ((a)>(b) ? (a) : (b))
#define min(a,b) ((a)<(b) ? (a) : (b))
#define feq(a,b) (fabs((a)-(b))<EPS)//a==b
#define fbg(a,b) ((a) > EPS+(b)) //a > b
#define fsm(a,b) ((b) > EPS+(a)) //a < b
#define fbgeq(a,b) ((a) >= (b)-EPS)  //a >= b
#define fsmeq(a,b) ((b) >= (a)-EPS)  //a <= b
struct Point
{
    double x,y;
    Point(){}
    Point(double _x,double _y):x(_x),y(_y){}
    Point operator -(const Point &b)const
    {
        return Point(x - b.x, y - b.y);
    }
    int operator ^(const Point &b)const
    {
        return x*b.y - y*b.x;
    }
    int operator *(const Point &b)const
    {
        return x*b.x + y*b.y;
    }
    void input()
    {
        scanf("%lf%lf",&x,&y);
    }
};
const int MAXN = 100110;
inline double pdis(Point a,Point b)
{
    return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}
inline double difcross(Point p0,Point p1,Point p2)
{
    return (p1.x-p0.x)*(p2.y-p0.y)-(p2.x-p0.x)*(p1.y-p0.y);
}
inline double dis(Point a,Point b)
{
    return (a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y);
}
inline double rotate_caliper(Point p[],int n)
{
    //printf("n = %d/n",n);
    double ans = 0;
    int cur = 1;
    //面积最大值
   /* for(int i = 0;i < n;i++)
    {
        int j = (i+1)%n;
        int k = (j+1)%n;
        while(j != i && k != i)
        {
            ans = max(ans,abs((p[j]-p[i])^(p[k]-p[i])));
            while( ( (p[i]-p[j])^(p[(k+1)%n]-p[k]) ) < 0 )
                k = (k+1)%n;
            j = (j+1)%n;
        }
    }*/
    //旋转卡壳，求两点间距离平方的最大值
    Point v;
    for(int i = 0;i < n;i++)
    {
        v = p[i]-p[(i+1)%n];
        while((v^(p[(cur+1)%n]-p[cur])) < 0)
            cur = (cur+1)%n;
        //printf("%d %d\n",i,cur);
        ans = max(ans,max(dis(p[i],p[cur]),dis(p[(i+1)%n],p[(cur+1)%n])));
    }
    //return ans/2.0;
    return ans;
}
Point p0;
int graham[MAXN],top,n;
Point points[MAXN],p[MAXN];
inline int cmp(Point a, Point b)
{
    double k = difcross(p0, a, b);
    if(feq(k,0) && fbg(pdis(a, p0) , pdis(b, p0)))return 1;
    else if( k > EPS ) return 1;
    return 0;
}
inline void ConvexHull()
{
        int i,u = 0;
        for(i = 1; i < n; i++)
        {
            if(fsm(points[i].y , points[u].y)||feq(points[i].y , points[u].y)
              &&fsm(points[i].x , points[u].x) )u = i;
        }
        swap(points[0],points[u]);
        p0 = points[0];
        sort( points+1, points + n, cmp );
        if(n <= 2)
        {
            top = n;
            for(int i = 0;i < n; ++i)
            {
                p[i] = points[i];
            }
            return;
        }
        graham[0] = 0;
        graham[1] = 1;
        graham[2] = 2;
        top = 2;
        for( i = 3; i < n; i++)
        {
            while(difcross(points[i],points[graham[top]],points[graham[top-1]])> EPS)
            {
                top--;
                if(top == 0)break;
            }
            graham[++top] = i;
        }
        top ++;
        for(int i = 0;i < top; ++i)
            p[i] = points[graham[i]];
}
int main()
{
   // freopen( "in.txt" , "r" , stdin );
    while(scanf("%d",&n) != EOF)
    {
        if(n == -1)break;
        for(int i = 0; i < n; ++i)
            points[i].input();
       /* if(n == 2)
        {
            n ++;
            points[n-1] = Point(0,0);
        }*/
        ConvexHull();
        double ans = rotate_caliper(p,top);
        printf("%lld\n",(LL)ans);
    }
    return 0;
}

sort(points,points+n,Point_cmp);
n=unique(points,points+n)-points;

去重