原理参考这篇博客,http://www.cnblogs.com/bourbon/archive/2011/08/23/2151044.html
关键的理解点是:
a[1]...a[n-1]的最大一段数组之和为all[1],包含a[1]进去的最大和为start[1],
所以a[0]...a[n-1]的最大子数组和all[0]为max(start[1]+a[0],a[0],all[1])
其中start[i]=max(start[i+1]+a[i],a[i])
从后往前进行计算
#include"iostream"
using namespace std;#define N 10
int max(int a, int b)
{
return a > b ? a : b;
}
int MaxArraySum(int a[], int n)
{
int start[N] = { -10 };
int all[N] = { -10 };
//int
start[n - 1] = a[n - 1];
all[n - 1] = a[n - 1];
for (int i = n - 2; i >= 0; i--)
{
start[i] = max(a[i], a[i] + start[i + 1]);
all[i] = max(start[i], all[i + 1]);
}
return all[0];
}
int main()
{
int a[N];
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
cout << MaxArraySum(a, n) << endl;
return 0;
}