博客
关于我
POJ - 1106 Transmitters
阅读量:510 次
发布时间:2019-03-07

本文共 2845 字,大约阅读时间需要 9 分钟。

Transmitters

In a wireless network with multiple transmitters sending on the same frequencies, it is often a requirement that signals don’t overlap, or at least that they don’t conflict. One way of accomplishing this is to restrict a transmitter’s coverage area. This problem uses a shielded transmitter that only broadcasts in a semicircle.

A transmitter T is located somewhere on a 1,000 square meter grid. It broadcasts in a semicircular area of radius r. The transmitter may be rotated any amount, but not moved. Given N points anywhere on the grid, compute the maximum number of points that can be simultaneously reached by the transmitter’s signal. Figure 1 shows the same data points with two different transmitter rotations.

All input coordinates are integers (0-1000). The radius is a positive real number greater than 0. Points on the boundary of a semicircle are considered within that semicircle. There are 1-150 unique points to examine per transmitter. No points are at the same location as the transmitter.

Input

Input consists of information for one or more independent transmitter problems. Each problem begins with one line containing the (x,y) coordinates of the transmitter followed by the broadcast radius, r. The next line contains the number of points N on the grid, followed by N sets of (x,y) coordinates, one set per line. The end of the input is signalled by a line with a negative radius; the (x,y) values will be present but indeterminate. Figures 1 and 2 represent the data in the first two example data sets below, though they are on different scales. Figures 1a and 2 show transmitter rotations that result in maximal coverage.

Output

For each transmitter, the output contains a single line with the maximum number of points that can be contained in some semicircle.

Sample Input
25 25 3.5
7
25 28
23 27
27 27
24 23
26 23
24 29
26 29
350 200 2.0
5
350 202
350 199
350 198
348 200
352 200
995 995 10.0
4
1000 1000
999 998
990 992
1000 999
100 100 -2.5

Sample Output3

4
4

#include 
#include
#include
#include
#include
#include
using namespace std;struct Point{ double x, y; int k;};Point p[154];double X, Y, R;bool dis(double a, double b){ return (a - X) * (a - X) + (b - Y) * (b - Y) <= R * R ? 1: 0;}double crossangle(Point a, Point b){ return (a.x - X) * (b.y - Y) - (a.y - Y) * (b.x - X);}int main() { int n; while(scanf("%lf %lf %lf", &X, &Y, &R) != EOF) { if(R <= 0) break; scanf("%d", &n); for(int i = 0; i < n; i++) { double s, t; scanf("%lf %lf", &s, &t); p[i].x = s, p[i].y = t; if(dis(s, t)) p[i].k = 1; else p[i].k = 0; } int ans = 0; for (int i = 0; i < n; i++) { int aa = 0;/因为crossangle(p[i], p[i]) == 0 for(int j = 0; j < n; j++) { if(p[i].k && p[j].k && crossangle(p[i], p[j]) >= 0) aa++; } ans = max(ans, aa); } printf("%d\n", ans); }}

转载地址:http://wsbnz.baihongyu.com/

你可能感兴趣的文章
MySQL 内核深度优化
查看>>
mysql 内连接、自然连接、外连接的区别
查看>>
mysql 写入慢优化
查看>>
mysql 分组统计SQL语句
查看>>
Mysql 分页
查看>>
Mysql 分页语句 Limit原理
查看>>
MySQL 创建新用户及授予权限的完整流程
查看>>
mysql 创建表,不能包含关键字values 以及 表id自增问题
查看>>
mysql 删除日志文件详解
查看>>
mysql 判断表字段是否存在,然后修改
查看>>
mysql 协议的退出命令包及解析
查看>>
mysql 取表中分组之后最新一条数据 分组最新数据 分组取最新数据 分组数据 获取每个分类的最新数据
查看>>
mysql 多个表关联查询查询时间长的问题
查看>>
mySQL 多个表求多个count
查看>>
mysql 多字段删除重复数据,保留最小id数据
查看>>
MySQL 多表联合查询:UNION 和 JOIN 分析
查看>>
MySQL 大数据量快速插入方法和语句优化
查看>>
mysql 如何给SQL添加索引
查看>>
mysql 字段区分大小写
查看>>
mysql 字段合并问题(group_concat)
查看>>