90pts求条，悬1棺

#include<bits/stdc++.h>
using namespace std;
const int N = 1e7 + 10;
int dp[N],a[N],n;
int main() {
	ios::sync_with_stdio(false);
	cin.tle(0),cout.tie(0);
    cin >> n;
    for(int i = 1;i <= n;i ++) {
    	cin >> a[i];
	}
	dp[1] = a[1];
	for(int i = 2;i <= n;i ++) {
		dp[i] = max(dp[i - 1] + a[i],a[i]);
	}
	sort(dp + 1,dp + n + 1);
	cout << dp[n];
	return 0;
}