博客
关于我
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 —— 在CentOS9下安装MySQL
查看>>
MySQL —— 视图
查看>>
mysql 不区分大小写
查看>>
mysql 两列互转
查看>>
MySQL 中开启二进制日志(Binlog)
查看>>
MySQL 中文问题
查看>>
MySQL 中日志的面试题总结
查看>>
mysql 中的all,5分钟了解MySQL5.7中union all用法的黑科技
查看>>
MySQL 中的外键检查设置:SET FOREIGN_KEY_CHECKS = 1
查看>>
Mysql 中的日期时间字符串查询
查看>>
mysql 中索引的问题
查看>>
MySQL 中锁的面试题总结
查看>>
MySQL 中随机抽样:order by rand limit 的替代方案
查看>>
MySQL 为什么需要两阶段提交?
查看>>
mysql 为某个字段的值加前缀、去掉前缀
查看>>
mysql 主从
查看>>
mysql 主从 lock_mysql 主从同步权限mysql 行锁的实现
查看>>
mysql 主从互备份_mysql互为主从实战设置详解及自动化备份(Centos7.2)
查看>>
mysql 主从关系切换
查看>>
MYSQL 主从同步文档的大坑
查看>>