2 shunfurh shunfurh 于 2017.01.02 17:40 提问

Lining Up
as

Problem 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
The input consists of multiple test cases, and each case begins with a single positive integer on a line by itself indicating the number of points, followed by N pairs of integers, where 1 < N < 700. Each pair of integers is separated by one blank and ended by a new-line character. No pair will occur twice in one test case.

Output
For each test case, the output consists of one integer representing the largest number of points that all lie on one line, one line per case.

Sample Input
5
1 1
2 2
3 3
9 10
10 11

Sample Output
3

1个回答

caozhy
caozhy   Ds   Rxr 2017.01.02 17:46
已采纳
Csdn user default icon
上传中...
上传图片
插入图片
准确详细的回答,更有利于被提问者采纳,从而获得C币。复制、灌水、广告等回答会被删除,是时候展现真正的技术了!
其他相关推荐
POJ Lining Up
给n(n   O()
poj -1020 - Dessert (通俗易懂) (本人小白
FJ has a new rule about the cows lining up for dinner. Not only must the N (3 &amp;lt;= N &amp;lt;= 15) cows line up for dinner in order, but they must place a napkin between each pair of cows with a &quot;+&quot;, &quot;-&quot;...
poj 1020 dessert DFS
Dessert Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 3969   Accepted: 1471 Description FJ has a new rule about the cows lining up for dinner. Not only m
poj1950 深搜
DessertDescriptionFJ has a new rule about the cows lining up for dinner. Not only must the N (3 <= N <= 15) cows line up for dinner in order, but they must place a napkin between each pair of cows with
B - Dessert
B -Dessert Crawling in process...Crawling failedTime Limit:1000MSMemory Limit:30000KB64bit IO Format:%I64d & %I64u SubmitStatus Description FJ has a new rule about the cows lining up f
uva 270 Lining Up
题意:问你若干个点中最多有几个在同一条直线上,那么我们先确定一条直线,然后再一一找就好了,在同一直线的条件是斜率相同,我们把它转化成等式的形式,就能避免误差了,至于怎么选点的方法就跟组合一个意思#include #include #include using namespace std; const int MAXN = 750 ; struct node { int x,y; }ar
uva270 Lining Up 搜索?
枚举所有两点,在此之上加上第三点,判断这三点是否共线 嘎嘎soeasy! #include #include #include #include #include #include #include #include #define inf 0x3f3f3f3f using namespace std; struct point { int x,y; }p[7
UVA 270 - Lining Up
题目大意: 解题思路: #include int main() { int t, x[705], y[705]; char str[100]; scanf("%d\n\n", &t); while (t--) { int n, ans = 0; for (n = 0; gets(str) && str[0] != '\0'; n++)
UVA 270 Lining up
解题思路:暴力枚举。每次先枚举出2个点。作为直线。再去枚举第三个点看在不在直线上。 利用直线的斜率计算公式,假设三个点,a(x1,y1) , b(x2,y2) , c(x3,y3) ,当(y2-y1)/(x2-x1)=(y3-y2)/(x3-x1) 时,说明共线。 注意:本题输入有坑,未指明什么时候输入结束,因此不能用普通的scanf输入,应用sscanf, 从一个字符串中读进与指定格式相符的数
Uva 270 Lining Up
题目链接:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=206 题意:给出一些点,求这些点中共线的点最多有多少个? 题解:没想到暴力枚举过了。。。直接三重循环枚举。没想到改了半天没过是因为把t++直接写到输入的数组下边里去了,然而并不知道为什