Envío 6183

Código

#include <bits/stdc++.h>
using namespace std;

long long maxSumSubArr(vector<long long> a){
    int n = a.size();
    if(n <= 1)
        return a[0];

    int m = n / 2;
    vector<long long> l(a.begin(), a.begin()+m);
    vector<long long> r(a.begin()+m, a.end());
    long long best = max(maxSumSubArr(l), maxSumSubArr(r));

    long long bsl, sl, bsr, sr;

    bsl = sl = a[m-1];
    for(int i=m-2; i>=0; i--){
        sl += a[i];
        bsl = max(bsl, sl);
    }
    bsr = sr = a[m];
    for(int i=m+1; i<n; i++){
        sr += a[i];
        bsr = max(bsr, sr);
    }

    return max(best, bsl+bsr);
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); 
    // your code goes here
    int n;
    cin >> n;
    vector<long long> a(n);
    for(int i=0;i<n;i++)
        cin >> a[i];
    cout << maxSumSubArr(a) << endl;
	return 0;
}