1052. Rabbit Hunt

最新推荐文章于 2019-12-24 23:41:54 发布

e_qing

最新推荐文章于 2019-12-24 23:41:54 发布

阅读量454

点赞数

分类专栏： Timus 文章标签： input output kill each

本文链接：https://blog.csdn.net/jie_qing/article/details/7631194

版权

Timus 专栏收录该内容

25 篇文章 1 订阅

订阅专栏

1052. Rabbit Hunt

Time Limit: 1.0 second
Memory Limit: 16 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 xand 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

能用乘，尽量yong

#include <iostream>
using namespace std;

int main()
{
	int i, j, k, max = 0, n, num;
	int x[200], y[200];
	cin>>n;
	for (i=0; i<n; i++)
		cin>>x[i]>>y[i];
	for (i=0; i<n-1; i++)
	{
		for (j=i+1; j<n-1; j++)
		{
			num = 2;
			for (k=j+1; k<n; k++)
				if ((x[k]-x[i])*(y[j]-y[i]) == (x[j]-x[i])*(y[k]-y[i]))
					num++;
			if (max < num)
				max = num;
		}
	}
	cout<<max<<endl;
}