#include<iostream>
#include<algorithm>
using namespace std;
const int N = 200010;
const int INF=1e9;
int arr[N], dp[N];
int main()
{
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++)
		cin >> arr[i];
	int Max = -INF;
	for (int i = 1; i < n; i++)
	{
		dp[i] = max(arr[i], dp[i - 1] + arr[i]);
		if (dp[i] > Max)
			Max = dp[i];
	}
	cout << Max;
	return 0;
}
···