poj 1118 Lining Up

#include <iostream> #include <algorithm> #include <cstring> using namespace std; int a[702][2]; float b[702]; int main(){ int n, i, max, j, k, cnt, num; while(cin>>n && n != 0){ memset(a, 0, sizeof(a)); for(i = 0; i < n; i++) cin>>a[i][0]>>a[i][1]; max = 2; for(i = 0; i < n-1; i++){ cnt = 0; num = 2; for(j = i + 1; j < n; j++){ if(a[i][0] == a[j][0]) b[cnt++] = 32767; else b[cnt++] = (float)(a[j][1]-a[i][1])/(float)(a[j][0]-a[i][0]); } sort(b, b+cnt); for(k = 1; k <= cnt; k++){ if(b[k-1] == b[k]){ num++; if(num > max) max = num; } else num = 2; } } cout<<max<<endl; } return 0; }