最大连续和（分治法)

/**/
#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#define maxs 202020
#define mme(i,j) memset(i,j,sizeof(i))
#define ll long long
using namespace std;


int a[maxs];


int maxsum(int be, int la)
{
int mi = (be + la) / 2;
if (be == la) return a[be];  //分到长度只有1时返回
int ma = max(maxsum(be, mi), maxsum(mi+1, la));  //先对不跨越中点的纯右和纯左进行比较
int l = a[mi], r = a[mi + 1], v = 0; //两个for循环处理跨域中点的确  中点向左右延伸
for (int i = mi; i >= be; i--)   
{
v += a[i];
if (v > l) l = v;
}
v = 0;
for (int i = mi + 1; i <= la; i++)
{
v += a[i];
if (v > r) r = v;
}
return max(ma, l + r);  //较大者再与跨越中点的进行比较
}


int main()
{
int n;
while (cin >> n)
{
for (int i = 0; i < n; i++) cin >> a[i];
cout << maxsum(0, n) << endl;
}
}