Maximum sum

#include <bits/stdc++.h>
using namespace std;
 
const int MAXN = 2e5 + 1;
long long n, f[MAXN], dp[MAXN];
 
void solve() {
    int n; 
    cin >> n;
    dp[0] = 0;
    for (int i = 1; i <= n; i++) {
        cin >> f[i];
        dp[i] = dp[i - 1] + f[i];
    }
    
    long long minn = 9999999999, maxx = -9999999999;
    long long res = -9999999999;
    for (int i = 1; i <= n; i++) {
        minn = min (dp[i - 1], minn);
        if (dp[i] > maxx) {
            maxx = dp[i];
            res = max (maxx - minn, res);
        }
    }
    
    cout << res;
    
   
}
 
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
 
    solve();
 
    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: ACCEPTED