最大连续子序列和

//
// Created by CyIce on 2021/1/30.
//

//最大连续子序列和

#include <stdio.h>
#include <algorithm>

using namespace std;

const int MAXN = 100000;
int N,A[MAXN],dp[MAXN]={0};

int main(){
    int ans;
    scanf("%d",&N);
    for (int i = 0; i < N; ++i) {
        scanf("%d",&A[i]);
    }
    dp[0] = A[0];
    ans = dp[0];
    for (int i = 1; i < N ; ++i) {
        dp[i] = max(A[i],dp[i-1]+A[i]);
        if(dp[i]>ans) ans = dp[i];
    }
    printf("%d\n",ans);

    return 0;
}