Rabbit hunt(P2606)

一次，无修改，很爽

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;

#define N 1011

int n;
struct my
{
	int x;
	int y;
}go[300];

bool vist[300][300];

int main()
{
	freopen("fuck.txt","r",stdin);
	int i,j,k;
	cin>>n;
	for (i=0;i<n;i++)
	{
		cin>>go[i].x>>go[i].y;
	}
	memset(vist,false,sizeof(vist));
	int ans=2;
	for (i=0;i<n;i++)
	{
		for (j=0;j<n;j++)
		{
			if (!vist[i][j]&&i!=j)

			{
				int num=2;
				for (k=0;k<n;k++)
				{
					if (k!=i&&k!=j)

					{
						if ((go[k].y-go[i].y)*(go[i].x-go[j].x)==(go[i].y-go[j].y)*(go[k].x-go[i].x))
							num++;
					}
				}
				ans=max(ans,num);
			}
		}
	}
	cout<<ans<<endl;

	return 0;
}