23 lines
445 B
C++
23 lines
445 B
C++
#include <iostream>
|
|
#include <utility>
|
|
#include <vector>
|
|
#include <climits>
|
|
#include <algorithm>
|
|
using namespace std;
|
|
const int INF = INT_MAX >> 1;
|
|
int main() {
|
|
int n;
|
|
cin >> n;
|
|
vector<int> a(n);
|
|
vector<int> dp(n + 1, -INF);
|
|
for (int i = 0; i < n; i++) {
|
|
cin >> a[i];
|
|
}
|
|
dp[0] = 0;
|
|
for (int i = 1; i < n + 1; i++) {
|
|
dp[i] = max(dp[i - 1] + a[i - 1], a[i - 1]);
|
|
}
|
|
cout << *max_element(dp.begin() + 1, dp.end()) << endl;
|
|
return 0;
|
|
}
|