-
Notifications
You must be signed in to change notification settings - Fork 0
/
8. Maximum Subarray Sum.cpp
49 lines (44 loc) · 1.11 KB
/
8. 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
42
43
44
45
46
47
48
49
#include "iostream"
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef set<ll> sl;
typedef map<char, ll> mcl;
typedef map<ll, ll> mll;
typedef pair<char, ll> pcl;
typedef pair<ll, ll> pll;
#define PB push_back
#define F first
#define S second
#define REP(i,a,b) for (ll i = a; i < b; i++)
#define REPR(i,a,b) for (ll i = a; i > b; i--)
#define REPJ(i,a,b,j) for (ll i = a; i < b; i+=j)
#define REPIT(it,o) for (auto it = o.begin(); it != o.end(); it++)
#define REPITR(it,o) for (auto it = o.rbegin(); it != o.rend(); it++)
int main() {
ll n;
cin >> n;
vl a;
REP(i,0,n){
ll tmp;
cin >> tmp;
a.PB(tmp);
}
ll ans = LLONG_MIN;
ll prev_sum = 0;
REP(i,0,n){
if (prev_sum+a[i] > a[i]){
prev_sum = prev_sum+a[i];
} else {
prev_sum = a[i];
}
ans= max(ans, prev_sum);
}
cout << ans;
}
// - initial approach
// iterate over the vector and upto each element max subarray sum = itself or prev max subarray + itself
// ac