Maximum sum

#include<iostream>
#include<vector>
#include<algorithm>
 
using namespace std;
 
long long maxSub(const vector<long long> & values, long long n){
    long long sum = 0;
    long long max_sum = -1e9;
    for(int i = 0; i < n; ++i){
        sum += values[i];
        max_sum = max(max_sum, sum);
        if(sum < 0) sum = 0;
 
    }
    return max_sum;
}
int main(){
    long long n;
    cin >> n;
    vector<long long> values(n);
    for(int i = 0; i < n; ++i)
        cin >> values[i];
 
    cout<<maxSub(values,n)<<endl;
}

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