1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
#include <iostream>
#include <vector>
#include <algorithm>
#include "maklib.h"


using namespace std;

long int n;
long int T;
long long suma = 0;
long long maxi = 0;
long int m = -2000000000;




int main() {
    n = Size();
    long int i = 1;
    while(n--) {
         T = ElementAt(i);
         if(T > m) {
            m = T;
         }
        suma += T;
        if(suma > maxi) {
            maxi = suma;
        }
        if(suma < 0) {
            suma = 0;
        }
        ++i;
    }
    if(maxi != 0)
    cout << maxi << endl;
    else
    cout << m << endl;
    return 0;
}