This commit is contained in:
Antti H S Laaksonen 2017-02-23 11:25:05 +02:00
parent 69bcc4224d
commit 6973081a7d
1 changed files with 1 additions and 1 deletions

View File

@ -478,7 +478,7 @@ the maximum sum of a subarray that ends at that position.
After this, the answer for the problem is the
maximum of those sums.
Condider the subproblem of finding the maximum-sum subarray
Consider the subproblem of finding the maximum-sum subarray
that ends at position $k$.
There are two possibilities:
\begin{enumerate}