Maximum sum

#include <bits/stdc++.h>

using namespace std;

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

    vector<long long> array_values(n); 
    vector<long long> count_array(n, 0);

    for (long long i = 0; i < n; i++) {
        long long c;
        cin >> c; 
        array_values[i] = c;
    }
    
    count_array[0] = array_values[0];
    long long max_value = count_array[0];

    for (long long x = 1; x < n; x++) {
        count_array[x] = max(array_values[x], array_values[x] + count_array[x-1]);
        if (count_array[x] > max_value) max_value = count_array[x];
    }
    
    cout << max_value << endl;

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

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED