枚举所有两点,在此之上加上第三点,判断这三点是否共线
嘎嘎soeasy!
#include <iostream>
#include <cstring>
#include <string>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <map>
#define inf 0x3f3f3f3f
using namespace std;
struct point
{
int x,y;
}p[705];
bool cmp(point a,point b)
{
return a.x<b.x;
}
int main()
{
int i,tmp,ans,j,k,n,k1,k2,k3,k4;
while(scanf("%d",&n)&&n)
{
for(i=0;i<n;i++)
scanf("%d%d",&p[i].x,&p[i].y);
sort(p,p+n,cmp);
ans=1;//不能为0 n为1的时候 应该输出1
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
tmp=2;
k1=p[j].x-p[i].x;
k2=p[j].y-p[i].y;
for(k=j+1;k<n;k++)
{
k3=p[k].x-p[j].x;
k4=p[k].y-p[j].y;
if(k1*k4==k2*k3)
{
tmp++;
// printf("%d %d %d\n",i,j,k);
}
}
if(tmp>ans) ans=tmp;
}
}
printf("%d\n",ans);
}
return 0;
}