学步园

枚举每两个点.

#include<iostream><br /> using namespace std;<br /> const int MAXN=200;<br /> int n,m;<br /> int x[MAXN];<br /> int y[MAXN];<br /> int main()<br /> {<br /> int i,j,k,dy,dx,count;<br /> scanf("%d",&n);<br /> for(i=0;i<n;i++)<br /> scanf("%d%d",&x[i],&y[i]);<br /> for(i=0;i<n;i++)<br /> for(j=0;j<i;j++)<br /> {<br /> dy=y[j]-y[i];<br /> dx=x[j]-x[i];<br /> count=0;<br /> for(k=0;k<n;k++)<br /> if(y[k]*dx==dy*(x[k]-x[i])+dx*y[i])<br /> count++;<br /> if(count>m) m=count;<br /> }<br /> printf("%d/n",m);<br /> return 0;<br /> }<br />