POJ 1106 Transmitters(叉积)
来源:互联网 发布:怎么使用js插件 编辑:程序博客网 时间:2024/05/03 02:44
Transmitters
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 4597 Accepted: 2460
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
Source
Mid-Central USA 2001
#include<iostream>#include<cstring>#include <algorithm>#include<cmath>using namespace std; struct p{double x;double y;}Point[1005];double x,y,r;bool f(double u,double v){double rr=(u-x)*(u-x)+(v-y)*(v-y);if(rr<=r*r)return 1;elsereturn 0;}int main(){while(cin>>x>>y>>r){if(r<0)return 0;int n;cin>>n;double u,v;int count=0;for(int i=0;i<n;i++){cin>>u>>v;if(f(u,v)){Point[count].x=u;Point[count].y=v;count++;}}int max=0;for(int i=0;i<count;i++){double x1=Point[i].x;double y1=Point[i].y;int loop=0;for(int j=0;j<count;j++){if(i!=j){if(((x1-x)*(Point[j].y-y)-(Point[j].x-x)*(y1-y))>0)loop++;}}loop=(loop>=(count-loop))?loop:(count-loop);max=max>loop?max:loop;}cout<<max<<endl;}return 0;}
0 0
- POJ 1106 Transmitters(叉积)
- POJ 1106 Transmitters(计算几何:叉积)
- POJ 1106 Transmitters(离散化)
- poj 1106 Transmitters(极角排序)
- POJ 1106 Transmitters (简单计算几何)
- POJ 1106 Transmitters (几何覆盖问题)
- POJ 题目1106 Transmitters(数学几何)
- POJ 1106 Transmitters
- poj 1106 Transmitters
- POJ 1106 Transmitters
- POJ 1106 Transmitters
- POJ 1106 Transmitters
- POJ 1106 Transmitters
- POJ 1106 Transmitters
- POJ 1106 Transmitters
- POJ 1106 Transmitters
- zoj 1041 || poj 1106 Transmitters
- POJ-1106 Transmitters解题报告
- Android for mono 科学计算器
- 重写hashCode()方法和重写equals()方法
- 使用ActivityGroup时,如何保存Activity状态、如何使用子Activity的Menu?
- VC隐藏控制台窗口
- 简单理解非对称加密算法
- POJ 1106 Transmitters(叉积)
- SQLite的limit用法
- linux awk命令详解
- TFS2010映射工作区问题 路径 已在工作区 中映射
- Replica Louis Vuitton g1bqW
- Fake LV NxGKy
- 怎样在浏览器内浏览pdf文件(其中总有一个适合你)
- HDU 2377 Bus Pass 最短路SPaf
- Louis Vuitton Outlet FcdlT