Maximum sum

#include <iostream>
#include <vector>

#include "bits/stdc++.h"
using namespace std;

const int N = 1e5 + 1;

int64_t arr[N];
int64_t maxValues[N];

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

  int64_t res = -1e9;

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

  for (int i = 0; i < n; i++) {
    int64_t currMax = arr[i];
    if (i > 0) {
      currMax = max(currMax, arr[i] + maxValues[i - 1]);
    }
    maxValues[i] = currMax;
    res = max(currMax, res);
  }

  cout << res;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: RUNTIME ERROR

Test 7

Verdict: RUNTIME ERROR

Test 8

Verdict: RUNTIME ERROR

Test 9

Verdict: RUNTIME ERROR

Test 10

Verdict: RUNTIME ERROR

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED