Tefnoc - Online C++0x Compiler & Debugging Tool

#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
const int MOD = 158400;
const int MOD2 = 998244353;
const int INF = LLONG_MAX/2;

int primes[1000000];

void seive(){
    fill(primes, primes + 1000000, 1);
    primes[0] = primes[1] = 0;
    for(int i = 2 ; i*i < 1000000 ; i++){
        if(primes[i]){
            for(int j = i*i ; j < 1000000 ; j += i){
                primes[j] = 0;
            }
        }
    }
    for(int i = 1 ; i < 1000000 ; i++){
        primes[i] += primes[i-1];
    }
}
int factorial(int n){
    if(n==0){
        return 1;
    }
    return (n*(factorial(n-1)))%MOD;
}
bool isPrime(int n){
    if(n <= 1) return false;
    for(int i = 2 ; i*i <= n ; i++){
        if(n % i == 0) return false;
    }
    return true;
}

int power(int a, int b){
    if(b == 0) return 1;
    a %= MOD;
    int value = power(a, b / 2);
    if(b % 2 == 0){
        return (value * value) % MOD;
    } else {
        return ((value * value) % MOD * (a % MOD)) % MOD;
    }
}

int gcd(int a, int b){
    if(a == 0) return b;
    return gcd(b % a, a);
}
void solve() {
    int n1;
    cin>>n1;
    int A[n1];
    for(int i = 0 ; i<n1 ; i++){
        cin>>A[i];
    }
    int B[n1],C[n1];
    B[0] = max(A[0],0LL);
    C[n1-1] = max(A[n1-1],0LL);
    for(int i = 1 ; i<n1 ; i++){
        B[i] = max({(B[i-1]+A[i]),A[i],0LL});
    }
    for(int i = n1-2 ; i>=0 ; i--){
        C[i] = max({(C[i+1]+A[i]),A[i],0LL});
    }
    int D[n1],E[n1];
    D[0] = B[0];
    E[n1-1] = C[n1-1];
    int maxi = 0;
    for(int i = 1 ; i<n1 ; i++){
        D[i] = max(D[i-1],B[i]);
    }
    for(int i = n1-2 ; i>=0 ; i--){
        E[i] = max(E[i+1],C[i]);
    }
    for(int i = 0 ; i<n1-1 ; i++){
        int d = D[i]+E[i+1];
        maxi = max(maxi,d);
    }
    cout<<maxi<<endl;
}

signed main(){
    ios::sync_with_stdio(false); cin.tie(NULL);
    //int t;
    //cin >> t;
    //while(t--){
        solve();
    //}
    return 0;
}