Maximum sum

#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;

int main() {
    int n;
    cin >> n;

    vector<ll> numbers;
    vector<ll> total;
    numbers.reserve(n);
    total.reserve(n);
    
    ll maxSum = -1000000001ll;
    for (int i=0; i<n; i++) {
        cin >> numbers[i];
    }

    ll subMax = 0;
    for (int i=0; i<n; i++) {
        maxSum = max(maxSum, numbers[i]);
        ll nextSum = subMax + numbers[i];
        if (nextSum < 0) continue;
        subMax += numbers[i];
        maxSum = max(maxSum, subMax);
    }

    cout << maxSum << endl;

    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED