题目链接:点击打开链接
题目大意:这三题的意思差不多,都是给一些点,求出在同一直线上数目最多的点数目
题目分析:其实想法就没打算用多难的算法,每后进一个点就分别求下和前面的点的斜率,然后排序
之前还想用bool型的k【】,k都是double型的没法计数啊= =
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#define INF 100000000
using namespace std;
int cmp(double a,double b)
{
return a>b;
}
struct poin
{ int x,y;}node[1001];
double k[1001];
int main()
{
int n,a,b,ans,i,j,p,t;
while(~scanf("%d",&n))
{
ans=0;
for(i=0;i<n;i++)
{
scanf("%d%d",&a,&b);
node[i].x=a,node[i].y=b;
for( j=0,p=0;j<i;j++,p++)
{
if(a==node[j].x) k[p]=INF;
else k[p]=(double)(b-node[j].y)/(a-node[j].x);
}
sort(k,k+p,cmp);
for(j=0;j<p;j++)
{
int count=1;
while(j+1<p&&k[j]==k[j+1]){count++;j++;}
if(count>ans)
ans=count;
}
}
printf("%d\n",ans+1);
}
return 0;
}