题目链接:https://oj.leetcode.com/problems/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
.
最大连续子序列和,经典DP问题
sum=sum<0?A[i]:A[i]+sum;
ma=max(ma,sum);
code:
class Solution {
public:
int maxSubArray(int A[], int n) {
int ma=INT_MIN;
int sum=INT_MIN;
for(int i=0;i<n;i++)
{
sum=sum<0?A[i]:A[i]+sum;
ma=max(ma,sum);
}
return ma;
}
};