Maximum Subarray

Find the contiguous subarray within an array (containing at least one number) which has the largest sum.
For example, given the array [-2,1,-3,4,-1,2,1,-5,4], the contiguous subarray [4,-1,2,1] has the largest sum = 6.

Solution: dp.

class Solution {
public:
    int maxSubArray(int A[], int n) {
        int dp = A[0];
        int res = A[0];
        for(int i = 1; i < n; i++) {
            dp = max(A[i], A[i] + dp);
            res = max(res, dp);
        }
        return res;
    }
};