Maximum sum

#include <algorithm>
#include <iostream>
#include <queue>
#include <vector>

using namespace std;

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

    vector<long int> a(n);
    for (int i = 0; i < n; i++)
    {
        cin >> a[i];
    }

    vector<long int> maxEnd(n);

    maxEnd[0] = a[0];

    long int maxe = -99999999999999;
    for (int i = 1; i < n; ++i) {
        maxEnd[i] = max(maxEnd[i - 1] + a[i], a[i]);
        if (maxEnd[i] > maxe) maxe = maxEnd[i];
    }


/*
    for (int i = 0; i < n; i++)
    {
        cout << maxEnd[i] << " ";
    }
    cout << endl;
*/

    cout << maxe << endl;


    
    // cin >> n >> m;
    // vector<vector<char> > map(n, vector<char>(m));
    // vector<vector<pair<int, int> > > path(n, vector<pair<int, int> >(m));
}

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: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: WRONG ANSWER