Envío 6184

Código

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

ll findBest(ll *a, int l, int r){
    if(l >= r) return a[l];
    int m = l+(r-l)/2;
    ll best = max(findBest(a, l, m), findBest(a, m+1, r));
    ll bsl, sl, bsr, sr;

    bsl = sl = a[m];
    for(int i=m-1; i>=l; i--){
        sl += a[i];
        bsl = max(bsl, sl);
    }
    bsr = sr = a[m+1];
    for(int i=m+2; i<=r; 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;
    ll a[n];
    for(int i=0;i<n;i++) cin >> a[i];
    cout << findBest(a, 0, n-1) << endl;
	return 0;
}