POJ 1106 Transmitters

最新推荐文章于 2019-07-29 22:57:01 发布

BinJourney

最新推荐文章于 2019-07-29 22:57:01 发布

阅读量560

点赞数

分类专栏： ACM 文章标签：计算几何

本文链接：https://blog.csdn.net/lj94093/article/details/43967775

版权

ACM 专栏收录该内容

137 篇文章 0 订阅

订阅专栏

把点和圆心连起来作为一个向量，然后判断点在向量右边且在圆内的有多少，再计算出左半边的点有多少，取最大值

#include<stdio.h>
#include<math.h>
#include<algorithm>
using namespace std;
const double eps=0.001;
struct Point {
    double x,y;
    Point(){}
    Point(double xx,double yy){x=xx;y=yy;}
    Point operator+(Point b){return Point(x+b.x,y+b.y);}
};
Point p[200];
double x,y,r;
int judge(Point a){
    return (a.x-x)*(a.x-x)+(a.y-y)*(a.y-y)<r*r+eps;
}
double xmul(Point p0,Point p1,Point p2){
    return (p1.x-p0.x)*(p2.y-p0.y)-(p2.x-p0.x)*(p1.y-p0.y);
}
int main(){
    #ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
    #endif // ONLINE_JUDGE

    int n;
    while(scanf("%lf%lf%lf",&x,&y,&r),r>=eps){
        scanf("%d",&n);
        for(int i=0;i<n;i++) scanf("%lf%lf",&p[i].x,&p[i].y);
        int sum=0;
        for(int i=0;i<n;i++) {
            if(judge(p[i])) sum++;
        }
        int ans=0;
        for(int i=0;i<n;i++) {
            int s1=0,s2=0,s;
            for(int j=0;j<n;j++){
                if(xmul(Point(x,y),p[i],p[j])>-eps &&judge(p[j])) s1++;
                if(xmul(Point(x,y),p[i],p[j])<eps &&judge(p[j])) s2++;
            }
            s=max(s1,s2);
            ans=max(s,ans);
        }
        printf("%d\n",ans);

    }
    return 0;
}