Question on dynamic programming:

Given a sequence of integers X1, ... , Xn (possibly including negative integers) and an interval of coordinates I = [i, j], write xj to denote the sum Eisks; Lk. Give a linear time algorithm to find the interval that maximizes xi