Maximum sum

#include <cstdio>
#include <iostream>
#include <vector>

using namespace std;

int main(int argc, char *argv[])
{
	long n;
	std::cin >> n;

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

	long result = numbers[0];
    vector<long> sums(n, 0);

    // vector<long> sums(n);
    // sums[0] = max(numbers[0], 0L);
    // for (int i = 0; i < n; i++) {
    //     long mid_sum = 0;
    //     for (int j = i; j >= 0; j--) {
    //         mid_sum = mid_sum + numbers[j];
    //     }
    // }

    sums[0] = numbers[0];
    long sum = numbers[0];
	for (long i = 1; i < n; i++) {
        if (sums[i - 1] < 1) {
            sum = numbers[i];
        } else {
            sum = sums[i - 1] + numbers[i];
            // sums[i] = sum;
        }
        sums[i] = sum;
        if (sums[i] > result) result = sums[i];
        
		// long mid_sum = 0;

		// for (long j = i; j >= 0; j--) {
		// 	mid_sum = mid_sum + numbers[j];
  //           result = max(result, mid_sum);
		// }
	}
	std::cout << result << "\n";
	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