POJ 1118 Lining Up & POJ 2606 Rabbit hunt(模拟)

最新推荐文章于 2019-09-23 11:29:27 发布

「已注销」

最新推荐文章于 2019-09-23 11:29:27 发布

阅读量1.5k

点赞数

分类专栏： ACM 文章标签： up integer input each output c

本文链接：https://blog.csdn.net/ChinaCzy/article/details/5247312

版权

ACM 专栏收录该内容

51 篇文章 0 订阅

订阅专栏

这两题买一送一，只要把代码稍微改一下2606就可以AC了

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

5
1 1
2 2
3 3
9 10
10 11
0

Sample Output

//此程序必须领会先排序后查找这一技巧的重要性
#include<iostream>
using namespace std;

double c[702][2];//坐标数组
double k[702];//斜率数组
//QSORT的double类型比较函数
int cmp_double( const void* a , const void* b )    
{        
	double* A = (double*)a;       
	double* B = (double*)b;       
	return *A > *B ? 1 : -1; 
}   
int main()
{
	int n,cnt,max,num;
	while(cin >> n)
	{
		if(n == 0)break;
		for(int i = 1;i <= n; ++i)
			cin >> c[i][0] >> c[i][1];
		max = 2;
		for(int i = 1;i <= n; ++i)
		{
			cnt = 0;
			num = 2;//最少有2个点满足条件
			for(int j = i+1;j <= n;++j)
			{	
				if(c[i][0] - c[j][0] != 0)
					k[cnt++] = (c[i][1] - c[j][1])/(c[i][0] - c[j][0]);
				else			//若斜率不存在，则用int的最大值代替
					k[cnt++] = 2147483647;
			}
			qsort(k,cnt,sizeof(k[0]),cmp_double);//用STL的快速排序，先将斜率数组排序，方便对共线点数的判定
			for(int i = 0;i < cnt;++i)
			{
				if(k[i] == k[i+1])
				{
					++num;
					if(num > max)
						max = num;
				}
				else
				{
					num = 2;
					if(num > max)
						max = num;
				}
			}	
		}
		cout << max <<endl;
	}
	return 0;
}