4838781_ce.cpp

部分PKU上的源码

#include<iostream.h>
#include<math.h>
#include<vector>
#include<algorithm>
using namespace std;

int main()
{
	vector<double> k2;
	size_t n,result=0,v_size,max_tmp=0;
	int x[201],y[201];
	double k[201][201];
	cin>>n;
		for(size_t i=0;i<n;i++)
		{
			cin>>x[i]>>y[i];
		}
		for(size_t i2=0;i2<n;i2++)
		{
			for(size_t i3=i2+1;i3<n;i3++)
			{
				k[i2][i3]=(y[i3]-y[i2])/(x[i3]-x[i2]);
				k2.push_back(k[i2][i3]);
			}
		}
		sort(k2.begin(),k2.end());
		v_size=k2.size();
		double k_tmp=k2[0];
		for(size_t i8=0;i8<v_size;i8++)
		{
			if(k_tmp==k2[i8]){max_tmp++;}
			else{k_tmp=k2[i8];if(max_tmp>result)result=max_tmp;max_tmp=1;}
		}
		cout<<result<<endl;
	return 1;
}