POJ 2606 / URAL 1502 Rabbit hunt (计算几何)
来源:互联网 发布:fifo置换算法 编辑:程序博客网 时间:2024/05/18 04:28
1052. Rabbit Hunt
http://poj.org/problem?id=2606
http://acm.timus.ru/problem.aspx?space=1&num=1052
Time limit: 1.0 second
Memory limit: 64 MB
A good hunter kills two rabbits with one shot. Of course, it can be easily done since for any two points we can always draw a line containing the both. But killing three or more rabbits in one shot is much more difficult task. To be the best hunter in the world one should be able to kill the maximal possible number of rabbits. Assume that rabbit is a point on the plane with integer x and y coordinates. Having a set of rabbits you are to find the largest number of rabbits that can be killed with single shot, i.e. maximum number of points lying exactly on the same line. No two rabbits sit at one point.
Input
An input contains an integer N (3 ≤ N ≤ 200) specifying the number of rabbits. Each of the next N lines in the input contains the x coordinate and the y coordinate (in this order) separated by a space (−2000 ≤ x, y ≤ 2000).
Output
The output contains the maximal number of rabbits situated in one line.
Sample
67 1228 1399 15610 17311 190-100 1
5
同这一题。
完整代码:
/*POJ: 32ms,204KB*//*URAL: 0.015s,148KB*/#include<cstdio>#include<cmath>#include<algorithm>using namespace std;const int INF = 1 << 30;char str[20];double x[705], y[705], d[705];int main(void){int n, i, j, k;int ans, count;scanf("%d", &n);for (i = 0; i < n; ++i)scanf("%lf%lf", &x[i], &y[i]);ans = 1;for (i = 0; i < n - 1; ++i){for (j = i + 1, k = 0; j < n; ++j, ++k)d[k] = (x[j] == x[i] ? INF : (y[j] - y[i]) / (x[j] - x[i]));sort(d, d + k);count = 1;for (j = 1; j < k; ++j){if (fabs(d[j] - d[j - 1]) < 1e-9){++count;ans = max(ans, count);}else count = 1;}}printf("%d", ans + 1);return 0;}
- POJ 2606 / URAL 1502 Rabbit hunt (计算几何)
- POJ 2606 Rabbit hunt(计算几何)
- URAL 1849|Rabbit Hunt 2|计算几何|二分|Set
- POJ 2606 Rabbit hunt【简单几何】
- poj 2606 Rabbit hunt
- poj 2606 Rabbit hunt
- 【POJ 2606】Rabbit hunt
- POJ 2606 Rabbit hunt
- ural 1052 Rabbit Hunt
- POJ 2606 Rabbit hunt 笔记
- ural 1052. Rabbit Hunt hash
- poj 2606 Rabbit hunt 解题报告
- poj Rabbit hunt
- poj P2606 Rabbit hunt
- poj 1066 Treasure Hunt 计算几何计数
- POJ 1066 Treasure Hunt(计算几何)
- POJ 1066Treasure Hunt 计算几何
- POJ 1118 Lining Up & POJ 2606 Rabbit hunt(模拟)
- Qt下使用GDB远程调试ARM板
- Windows 7-64位上编译webkit源码纪实
- Unable to get the default Bean Validation
- 论文发表的建议
- UVa 10038 / POJ 2575 / ZOJ 1879 Jolly Jumpers (water ver.)
- POJ 2606 / URAL 1502 Rabbit hunt (计算几何)
- 20130921
- UVa 10082 WERTYU (water ver.)
- 18 - generate parentheses
- UVa 10370 Above Average (water ver.)
- 安装mono for android 4.2.5后出现启动vs报错 的解决方式
- UVa 623 500! (高精度阶乘)
- uva oj 442
- TortoiseGit使用入门