Kattis - Maximum Number of Colinear Points

Author: Benjamin Qi


Time Complexity: O(N2logN)\mathcal{O}(N^2\log N)

Add one to the line passing through each pair of points.

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using db = double;
using str = string; // yay python!
using pi = pair<int, int>;
using pl = pair<ll, ll>;

Join the USACO Forum!

Stuck on a problem, or don't understand a module? Join the USACO Forum and get help from other competitive programmers!