此题是昨天四题的后继OTZ,一直改到上三角矩阵才过,YM wm大神的神数据OTZ,我还是没想出是什么数据…改过的版本在此,因为合并了循环的关系,特判n=1的地方不是很优美,这样空间上可以缩减1维,不过这种O(n^2logn)的算法空间能用多大呢,Orz~
贴代码如下:
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#define LL __int64
#define eps 1e-10
#define inf 1000000000
using namespace std;
LL ans,n,tmp,mm,x[1005],y[1005];
double now,na[1005][1005];
int main()
{
LL i,j;
while(EOF!=(scanf("%I64d",&n)))
{
memset(na,0,sizeof(na));
ans=0;
for(i=0;i<n;i++)
scanf("%I64d%I64d",&x[i],&y[i]);
if(n==1){
printf("%I64d\n",n);
continue;
}
for(i=0;i<n;i++){
for(j=i+1;j<n;j++)if(i!=j){
if(x[i]==x[j])
na[i][j]=inf;
else
na[i][j]=(double)(y[j]-y[i])/(double)(x[j]-x[i]);;
if(na[i][j]==-0) na[i][j]==0;
//printf("%lf",na[i][j]);
}
//printf("\n");
sort(&na[i][i+1],&na[i][n]);
tmp=2;
mm=0;
for(j=i+2;j<n;j++){
if(fabs(na[i][j]-na[i][j-1])<eps)
tmp++;
else {
now=na[i][j];
mm=max(mm,tmp);
tmp=2;
}
}
mm=max(tmp,mm);
ans=max(mm,ans);
}
printf("%I64d\n",ans);
}
return 0;
}