F[i]表示以A[i]结尾的最大子串和.
F[i]=max{A[i],A[i]+F[i-1]}.
F[0]=A[0].
public class Solution {
public int maxSubArray(int[] A) {
int n=A.length;
int[] F=new int[n];
int max,i;
F[0]=A[0];
max=A[0];
for(i=1;i<n;i++)
{
if(A[i]>A[i]+F[i-1])
F[i]=A[i];
else
F[i]=A[i]+F[i-1];
if(max<F[i])
max=F[i];
}
return max;
}
}