代码如下：

#include<iostream>
#include<cstdio>
using namespace std;
int n,a[10010],dp[10010],Max = -0x3f3f3f3f;
int main(){
	cin >> n;
	for(int i = 1;i <= n;i++){
		scanf("%d",&a[i]);
		dp[i] = a[i];
	}
	for(int i = 1;i <= n;i++){
		dp[i] = max(dp[i],dp[i-1]+dp[i]);
		Max = max(Max,dp[i]);
	}
	cout << Max;
	return 0;
}