-
Notifications
You must be signed in to change notification settings - Fork 2
/
maximum_subarray_sum.cpp
43 lines (37 loc) · 1.06 KB
/
maximum_subarray_sum.cpp
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
41
#include <bits/stdc++.h>
#define f first
#define s second
#define endl "\n"
#define int ll
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
template <typename T1, typename T2>
ostream &operator <<(ostream &os, pair<T1, T2> p){os << p.first << " " << p.second; return os;}
template <typename T>
ostream &operator <<(ostream &os, vector<T> &v){for(T i : v)os << i << ", "; return os;}
template <typename T>
ostream &operator <<(ostream &os, set<T> s){for(T i : s) os << i << ", "; return os;}
template <typename T1, typename T2>
ostream &operator <<(ostream &os, map<T1, T2> m){for(pair<T1, T2> i : m) os << i << endl; return os;}
int N;
int x[200000];
set<int> pre;
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> N;
int ans = INT_MIN;
for(int i = 0; i < N; i++){
cin >> x[i];
if(i > 0){
x[i] += x[i-1];
}
ans = max(ans, x[i]);
ans = max(ans, x[i] - *pre.begin());
pre.insert(x[i]);
}
cout << ans << endl;
return 0;
}