POJ 2606 / URAL 1502 Rabbit hunt (计算几何)

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

input	output
6 7 122 8 139 9 156 10 173 11 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;
}