20 lines
388 B
C++
20 lines
388 B
C++
// Maximum Subarray Sum
|
|
|
|
#include<bits/stdc++.h>
|
|
|
|
using namespace std;
|
|
using ll = long long;
|
|
|
|
int main() {
|
|
int n; cin >> n;
|
|
ll max_sum = INT32_MIN;
|
|
ll current_sum = INT32_MIN;
|
|
for (int i{}; i < n; i++) {
|
|
ll a; cin >> a;
|
|
current_sum = max(current_sum + a, a);
|
|
max_sum = max(current_sum, max_sum);
|
|
}
|
|
cout << max_sum << endl;
|
|
return 0;
|
|
}
|