#include <iostream>
#include <algorithm>
using namespace std;
//动态规划求解最大子段和问题
int maxSubSumDP(int a[], int n){
int f[n+1];
f[0] = 0;
int res = -0x3f3f3f3f;
for (int i = 1; i <= n; i++){
if (f[i-1] >= 0){
f[i] = f[i-1] + a[i];
}else{
f[i] = a[i];
}
res = max(res, f[i]);
}
return res;
}
//分治法最大子段和问题
int maxSubSumDC(int l, int r, int a[]){
if (l == r){
return a[l];
}
int maxSum;
int mid = (l + r) / 2;
int leftMax = maxSubSumDC(l, mid, a);
int rightMax = maxSubSumDC(mid + 1, r, a);
maxSum = max(leftMax, rightMax);
int t = 0;
int left = a[mid];
for (int i = mid; i >= l; i--){
t += a[i];
left = max(left, t);
}
int right = a[mid + 1];
t = 0;
for (int i = mid+1; i <= r; i++){
t+=a[i] ;
right = max(right, t);
}
maxSum = max(maxSum, left+right);
return maxSum;
}
int main(int argc, char** argv) {
cout << "请输入序列长度:" << endl;
int n;
cin >> n;
cout << "请输入序列元素:" << endl;
int a[n];
for(int i = 1; i <= n; i++){
cin >> a[i];
}
// {-20, 11, -4, 13, -5, -2};
cout << "分治法-最大子段和为:" << maxSubSumDP(a, n) << endl;
cout << "动态规划-最大子段和为:" << maxSubSumDC(1, n, a) << endl;
return 0;
}