Maximum Subarray Sum

At 6:16, how is left=i and right=j?

because if array is
-1 -2 -3
then for this ans should be 0 and subarray is empty subarray
so to also include this we have don that
if left and right value==-1 then empty subarray is ans