LQB 1D

最新推荐文章于 2021-10-02 16:28:48 发布

大道殊同

最新推荐文章于 2021-10-02 16:28:48 发布

阅读量241

点赞数

分类专栏： contest

本文链接：https://blog.csdn.net/zero_1778393206/article/details/60868340

版权

contest 专栏收录该内容

18 篇文章 0 订阅

订阅专栏

Description

"How am I ever going to solve this problem?" said the pilot.

Indeed, the pilot was not facing an easy task. She had to drop packages at specific points scattered in a dangerous area. Furthermore, the pilot could only fly over the area once in a straight line, and she had to fly over as many points as possible. All points were given by means of integer coordinates in a two-dimensional space. The pilot wanted to know the largest number of points from the given set that all lie on one line. Can you write a program that calculates this number?

Your program has to be efficient!

Input

Input consist several case,First line of the each case is an integer N ( 1 < N < 700 ),then follow N pairs of integers. Each pair of integers is separated by one blank and ended by a new-line character. The input ended by N=0.

Output

output one integer for each input case ,representing the largest number of points that all lie on one line.

Sample Input

Sample Output

#include<iostream> 
#include<cstdio>
#include<string.h>
#include<algorithm>
using namespace std;

int pos[750][5];

int main()
{
	int t,n;
	while(scanf("%d",&n)&&n!=0)
	{
		for(int i=1;i<=n;i++)
		{
			int a,b;
			scanf("%d%d",&a,&b);
			pos[i][1]=a,pos[i][2]=b;
		}
		int ans=0;
		int Max=0;
		for(int i=1;i<=n;i++)
		{
			for(int j=i+1;j<=n;j++)
			{
				ans=2;
				for(int k=j+1;k<=n;k++)
				{
				
					int dx=(pos[j][2]-pos[i][2])*(pos[k][1]-pos[j][1]);
					int dy=(pos[k][2]-pos[j][2])*(pos[j][1]-pos[i][1]);
					if(dx==dy)
						ans++;		
					
				}
				
				Max=max(Max,ans);
			}
		}
		if(n==1) Max=1;
		if(n==2) Max=2;
		printf("%d\n",Max);
		
	}
	return 0;
}

暴力竟也能过