Envío 2538

Código

#include<iostream>
#include<vector>

using namespace std;

int main(){
    int n;
    cin>>n;
    if(n==0) { 
        cout<<0<<endl; 
        return 0;
    }
    vector<int> vals(n);
    for(auto &val: vals){
        cin>>val;
    }
    int maxPossible = vals[0];
    int maxPossibleEnd = vals[0];
    for(int i=1; i<vals.size(); i++){
        maxPossibleEnd = maxPossibleEnd+vals[i];
        if(maxPossibleEnd<vals[i]){
            maxPossibleEnd = vals[i];
        }
        if(maxPossible<maxPossibleEnd){
            maxPossible = maxPossibleEnd;
        }
    }
    cout<<maxPossible<<endl;
    return 0;
}