bzoj3564 信号增幅仪【最小圆覆盖+坐标变换】

解题思路：

先把坐标系旋转a度，再把每个点的横坐标缩小p倍，求最小圆覆盖即可。
最小圆覆盖详见：
https://wenku.baidu.com/view/584b6d3e5727a5e9856a610d.html
玄学O(n)算法。
这里附一张坐标旋转的图，一眼懂：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<cmath>
#include<ctime>
#include<queue>
#include<vector>
#include<set>
using namespace std;

int getint()
{
    int i=0,f=1;char c;
    for(c=getchar();(c!='-')&&(c<'0'||c>'9');c=getchar());
    if(c=='-')c=getchar(),f=-1;
    for(;c>='0'&&c<='9';c=getchar())i=(i<<3)+(i<<1)+c-'0';
    return i*f;
}

const int N=50005;
const double PI=acos(-1),eps=1e-8;
struct point
{
    double x,y;
    point(){}
    point(double _x,double _y):x(_x),y(_y){}
    inline friend point operator + (const point &a,const point &b)
    {return point(a.x+b.x,a.y+b.y);}
    inline friend point operator - (const point &a,const point &b)
    {return point(a.x-b.x,a.y-b.y);}
    inline friend point operator * (const point &a,const double &b)
    {return point(a.x*b,a.y*b);}
    inline friend double operator * (const point &a,const point &b)
    {return a.x*b.y-a.y*b.x;}
    inline point n(){return point(-y,x);}
    inline double dis(){return sqrt(x*x+y*y);} 
}p[N],O;
struct line
{
    point st,ed;
    line(){}
    line(point _st,point _ed):st(_st),ed(_ed){}
};
int n,m;
double ang,Sin,Cos,R;

point getcross(line a,line b)
{
    double x=(a.ed-a.st)*(b.st-a.st);
    double y=(b.ed-a.st)*(a.ed-a.st);
    point t=b.st+(b.ed-b.st)*(x/(x+y));
    return t;
}

void Circle(point a,point b,point c)
{
    point s,t;
    line l1,l2;
    if(abs((a-b)*(a-c))<eps)
    {
        s=a,t=b;double d=(a-b).dis();
        if((b-c).dis()>d)s=b,t=c,d=(b-c).dis();
        if((a-c).dis()>d)s=a,t=c,d=(a-c).dis();
        O=(s+t)*0.5,R=d*0.5;
    }
    else
    {
        s=(a+b)*0.5,t=s+(b-a).n();
        l1=line(s,t);
        s=(a+c)*0.5,t=s+(c-a).n();
        l2=line(s,t);
        O=getcross(l1,l2),R=(O-a).dis();
    }
}

bool in(point a)
{
    return (O-a).dis()<=R;
}

void MC()
{
    srand(2333);
    random_shuffle(p+1,p+n+1);
    Circle(p[1],p[1],p[2]);
    for(int i=3;i<=n;i++)
        if(!in(p[i]))
        {
            Circle(p[1],p[1],p[i]);
            for(int j=2;j<i;j++)
                if(!in(p[j]))
                {
                    Circle(p[j],p[j],p[i]);
                    for(int k=1;k<j;k++)
                        if(!in(p[k]))Circle(p[k],p[j],p[i]);
                }
        }
    printf("%0.3f",R);
}

int main()
{
    //freopen("lx.in","r",stdin);
    //freopen("lx.out","w",stdout);
    n=getint();
    if(n==1)
    {
        puts("0.000");
        return 0;
    }
    for(int i=1;i<=n;i++)
        p[i].x=getint(),p[i].y=getint();
    ang=getint(),m=getint();
    ang=ang*PI/180,Sin=sin(ang),Cos=cos(ang);
    for(int i=1;i<=n;i++)
    {
        double x=p[i].x,y=p[i].y;
        p[i].x=x*Cos+y*Sin,p[i].y=y*Cos-x*Sin;
        p[i].x/=m;
    }
    MC();
    return 0;
}