【计算几何】Transmitters

链接

ZOJ Transmitters

题目描述

给出一个平面，上面有一些点，给出原点n和半径r，问以原点为圆心，半径为r的半圆最多可以包含多少个点

思路

先把不在范围内的点去掉，然后跑每个点对应其他点是左还是右(叉积)，取最大值，如果共线则两边都+1

代码

#include<algorithm> 
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>

using namespace std;

double r;
bool b[1005];
int x[1005], y[1005];
int nx, ny, n, le, ri, maxn;

bool pd(int x, int y)
{
	if(sqrt((x - nx)*(x - nx) + (y - ny)*(y - ny)) > r) return 0;
	return 1; 
}

int chaji(int a, int b)
{
	return(x[a] - nx)*(y[b] - ny) - (x[b] - nx)*(y[a] - ny);//求叉积
}

int main()
{
	scanf("%d%d%lf", &nx, &ny, &r);
	while(r > 0) {
		maxn = 0;
		memset(b, 0, sizeof(b));
		scanf("%d", &n);
		for(int i = 1; i <= n; ++i)
			scanf("%d%d", &x[i], &y[i]), b[i] = pd(x[i], y[i]);
		for(int i = 1; i <= n; ++i)
		{
			ri = le = 1;
			if(!b[i]) continue;			
			for(int j = 1; j <= n; ++j)
			{
				if(!b[j]) continue;
				if(j == i) continue; 
				if(chaji(i, j) > 0) le++;
					else if(chaji(i, j) < 0) ri++; 
						else le++, ri++;
			}
			maxn = max(le, max(ri, maxn));
		}
		printf("%d\n", maxn);
		scanf("%d%d%lf", &nx, &ny, &r);
	}
	return 0;
}