http://oj.leetcode.com/problems/maximum-subarray/
class Solution {
public:
int maxSubArray(int A[], int n) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
int last=A[0];
int ans=A[0];
for(int i=1;i<n;i++){
last=max(A[i],A[i]+last);
ans=max(ans,last);
}
return ans;
}
};