Solving the maximum (contiguous) subsequence sum problem in Python from a slow brute-force O(n^3) approach down to an elegant linear-time algorithm that also returns the subsequence itself.