poj1106Transmitters【求旋转半圆能覆盖的最多点数】
来源:互联网 发布:nginx lua 灰度 编辑:程序博客网 时间:2024/05/10 23:19
Language:
Transmitters
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 4803 Accepted: 2569
Description
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.
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.5725 2823 2727 2724 2326 2324 2926 29350 200 2.05350 202350 199350 198348 200352 200995 995 10.041000 1000999 998990 9921000 999100 100 -2.5
Sample Output
344
题意:给定一个半圆的圆心坐标和半圆半径半圆可以绕圆心旋转求半圆在旋转过程中能覆盖的最多点;
解题思路:先求出点与圆心距离小于r的点然后利用叉积枚举算出叉积大于零的点数即为半圆能覆盖的点数;
AC代码
#include<cstdio>#include<cstdlib>#include<cstring>#include<cmath>#include<algorithm>#define eps 1e-8using namespace std;struct point{double x,y;}A[160],B[160];double dist(point a,point b){return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));}double cp(point p1,point p2,point p3){return (p2.x-p1.x)*(p3.y-p1.y)-(p2.y-p1.y)*(p3.x-p1.x);}int main(){int n,i,j,k;double r;while(scanf("%lf%lf%lf",&A[0].x,&A[0].y,&r)){if(r<0)break;scanf("%d",&n);k=0;for(i=1;i<=n;++i){scanf("%lf%lf",&A[i].x,&A[i].y);if(dist(A[i],A[0])-r<eps)B[k++]=A[i];}int ans=0;for(i=0;i<k;++i){int cnt=0;for(j=0;j<k;++j){if(cp(A[0],B[i],B[j])>=0)cnt++;}ans=max(ans,cnt);}printf("%d\n",ans);}return 0;}
0 0
- poj1106Transmitters【求旋转半圆能覆盖的最多点数】
- 求绳子最多能覆盖的点
- poj 1981 Circle and Points(固定半径的圆能覆盖的最多点数)
- 绳子可以覆盖的最多点数
- 算法题:最多覆盖点数
- 每日一题(96) - 线段最多覆盖的点数
- LightOJ1292->求最多共线点数
- lightoj1292Laser Shot【共线判断求共线的最多点数】
- 求二维平面上共线最多的点数
- POJ1981Circle and Points【单位圆能覆盖的最多点】
- POJ 1118+2606+2780 (求平面上同一条直线的最多点数)
- 求一条直线经过一个直角坐标系里m个点最多点的点数
- max-points-on-a-line(求最多点数的一条线)
- 给定一系列x轴的点坐标,例如 1,3,7,8,9,11这些坐标升序放在数组中,现在给一根绳子,长度为4,问绳子最多能覆盖的点数有多少,例如绳子放前面只能覆盖两个点,1,3,如果放后面能覆盖4个点。
- POJ 1981 Circle and Points(求半径R圆覆盖最多点数及由圆上两点和半径求圆心)
- 寻找平面内共线点数最多的直线和点数
- hdu 1077 圆覆盖的最大点数
- [湖大热身赛]Pesky Mosquitoes(求圆覆盖最大点数)
- java正则表达式
- servlet内置对象
- JSP编码以及乱码解决总结
- 作用域
- CentOS 6下Nvidia显卡驱动程序的安装整理总结
- poj1106Transmitters【求旋转半圆能覆盖的最多点数】
- EmguCV录制视频
- 一 JavaScript概述
- 重定向和转发
- jsp标签
- Laser-induced CVD
- 快速排序转载
- 错误记录--The import XXX cannot be resolved
- 过滤器