标签：style blog http io color ar sp for div
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.
If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.
Divide and Conquer Array Dynamic Programming
class Solution { public: int maxSubArray(int A[], int n) { int sum=0; int subsum=INT_MIN; for(int i=0;i<n;i++){ sum=max(sum+A[i],A[i]); subsum=max(sum,subsum); } return subsum; } };
标签：style blog http io color ar sp for div
原文地址：http://www.cnblogs.com/li303491/p/4083563.html
