How would you solve a variation to the maximum subarray problem, so that the sum should be between two bounds?

Question

Lets say I have an array with integers, which represent the daily changes in the price of a stock, as an example the following array: [3, -1, -4, 1, 5, -9, 2, 6]. How would I fi