You are given an array containing n integers (Notice that the array contains both positive and negative integers). Suppose we want to find the sum of a contiguous subarray of numbers that has the largest sum. Write a recursive formula that helps to solve the problem.

(use c language or c++)