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