Maximum sum

#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <sstream>
using namespace std;

int main() {
    int n;
    cin >> n;
    vector<long> num(n);
    for (int i = 0; i < n; i++){
        cin >> num[i];
    }
    
    long total = num[0];
    long curMax = num[0];
    for (int i = 1; i < n; i++){
        total = max(total + num[i], num[i]);
        curMax = max(curMax, total);
    }
    cout << curMax;
    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