bzoj千题计划209：bzoj1185: [HNOI2007]最小矩形覆盖

http://www.lydsy.com/JudgeOnline/problem.php?id=1185

题解去看它

http://www.cnblogs.com/TheRoadToTheGold/p/8253800.html

精度真是卡的我醉生梦死，w(ﾟДﾟ)w    Ｏ(≧口≦)Ｏ

bzoj改成long double 就过了

洛谷仍处于

输出x.99999，答案输出x+1.00000

输出-0.00000，答案输出0.00000

救命啊~~~~(>_<)~~~~

来自大佬的建议：输出double时用%f

#include<cmath>
#include<cstdio>
#include<algorithm>

#define N 50001

using namespace std;

const long double eps=1e-;

int dcmp(long double x)
{
    if(fabs(x)<eps) return ;
    return x< ? - : ;
}

struct Point
{
    long double x,y;

    Point(long double x=,long double y=) : x(x),y(y) { }

    bool operator < (Point p) const
    {
        if(!dcmp(x-p.x)) return y<p.y;
        return x<p.x;
    }

    bool operator == (Point p) const
    {
        return !dcmp(x-p.x) && !dcmp(y-p.y);
    }
};

typedef Point Vector;

Point P[N],C[N];

Point AnsP[];

Vector operator + (Vector A,Vector B) { return Vector(A.x+B.x,A.y+B.y); }
Vector operator - (Vector A,Vector B) { return Vector(A.x-B.x,A.y-B.y); }
Vector operator * (Vector A,double q) { return Vector(A.x*q,A.y*q); }

long double Cross(Vector A,Vector B)
{
    return A.x*B.y-A.y*B.x;
}

long double Area2(Point A,Point B,Point D)
{
    return Cross(B-A,D-A);
}

long double Dot(Vector A,Vector B)
{
    return A.x*B.x+A.y*B.y;
}

long double Length(Vector A)
{
    return sqrt(Dot(A,A));
}

int ConvexHull(Point *p,int n,Point *c)
{
    sort(p,p+n);
    n=unique(p,p+n)-p;
    int m=;
    for(int i=;i<n;++i)
    {
        while(m> && Cross(c[m-]-c[m-],p[i]-c[m-])<=) m--;
        c[m++]=p[i];
    }
    int k=m;
    for(int i=n-;i>=;--i)
    {
        while(m>k && Cross(c[m-]-c[m-],p[i]-c[m-])<=) m--;
        c[m++]=p[i];
    }
    m--;
    return m;
}

long double getdis(Point A,Point B)
{
    return sqrt((A.x-B.x)*(A.x-B.x)+(A.y-B.y)*(A.y-B.y));
}

void RotatingCaliper(Point *c,int m)
{
    long double AnsArea=1e20,AnsPeri=1e20;
    int q=,l=,r=;
    long double d,h,w,rw;
    for(int p=;p<m;++p)
    {
        while(fabs(Cross(c[p]-c[p+],c[q+]-c[p+]))>fabs(Cross(c[p]-c[p+],c[q]-c[p+]))) q=(q+)%m;
        while(dcmp(Dot(c[p+]-c[p],c[r+]-c[r]))>)
        r=(r+)%m;
        if(!l) l=q;
        while(dcmp(Dot(c[p+]-c[p],c[l+]-c[l]))<)
        l=(l+)%m;
        d=Length(c[p+]-c[p]);
        h=fabs(Area2(c[p],c[p+],c[q]))/d;
        w=Dot(c[p+]-c[p],c[r]-c[l])/d;
        rw=Dot(c[r]-c[p],c[p+]-c[p])/d;
        if(w*h<AnsArea)
        {
            AnsArea=w*h;
            AnsP[]=c[p]+(c[p+]-c[p])*(rw/d);
            AnsP[]=AnsP[]+(c[r]-AnsP[])*(h/getdis(c[r],AnsP[]));
            AnsP[]=AnsP[]+(c[q]-AnsP[])*(w/getdis(c[q],AnsP[]));
            AnsP[]=AnsP[]+(c[l]-AnsP[])*(h/getdis(c[l],AnsP[]));
        }
    }
    double out=AnsArea;
    printf("%.5lf\n",out);
}

bool less(Point A,Point B)
{
    if(!dcmp(A.y-B.y)) return A.x<B.x;
    return A.y<B.y;
}

int main()
{
    int n,m;
    scanf("%d",&n);
    double x,y;
    for(int i=;i<n;++i)
    {
        scanf("%lf%lf",&x,&y);
        P[i]=Point(x,y);
    }
    m=ConvexHull(P,n,C);
    RotatingCaliper(C,m);
    int s=;
    for(int i=;i<;++i)
        if(less(AnsP[i],AnsP[s])) s=i;
    double outx,outy;
    for(int i=;i<;++i)
    {
        if(!dcmp(AnsP[(i+s)%].x)) AnsP[(i+s)%].x=;
        if(!dcmp(AnsP[(i+s)%].y)) AnsP[(i+s)%].y=;
        outx=AnsP[(i+s)%].x+eps;
        outy=AnsP[(i+s)%].y+eps;
        printf("%.5lf %.5lf\n",outx,outy);
    }
}