In the maximum subarray problem, we are given a vector of integers vec and want to find the maximum sum of entries in a contiguous subvector. That is$,$ we want to find indices

$$

$<=$

$$

i$<=$j so that vec$[$i$]+$ vec$[$i$+1]+...+$ vec$[$j$]$ is as large as possible. Here is an example: