1. Initialize the variables to keep a track of the max_sum, representing the global maximum sum, curr_sum representing the current temporary sum, start index and the end index of the array's elements representing the start and end indices of the contiguous subsequence whose sum will be maximum.
2. Loop over the array. Add the current element to the current temporay sum and do the following comparisions :
3. If the current sum is less than the value of the current element, make the current element the current sum. The index of the current element becomes the start and end indices of the subsequence.
4. Else include the current element into the current sum and set the index of the current element as the ending index of the subsequence.
5. If current sum is greater than max sum update the max sum with the current sum and store the start index and end index in temporary variables which will be returned back along with the sum in the res array.
