maximun subarray

class Solution {
public:
    int maxSubArray(int A[], int n) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        vector<int> vec( n, 0 );
        int m = vec[0] = A[0];
        for(int i=1;i<n;i++)
        {
            vec[i] = vec[i-1] < 0 ? A[i] : A[i] + vec[i-1];
            m = max( m , vec[i] );
        }
        return m;
    }
};