编程之美 - 求数组的子数组之和的最大值

#include<iostream>
using namespace std;

int max(int a,int b)
{
	return (a>b)?a:b;
}

int MaxSum(int A[],int n)
{
	int nStart = A[n-1];
	int nAll = A[n-1];
	for(int i=n-2; i>=0; --i)
	{
		nStart = max(A[i],nStart+A[i]);
		nAll = max(nStart,nAll);
	}
	return nAll;
}

int main()
{
	int A[] = {
	-2,5,3,-6,7,-8,6	
	};
	cout << MaxSum(A,7) << endl;
}