What if the whole array, which is unknown, is negative, then how do we find the maximum sum, in O(n) time?
