#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int n, a[N], s[N], minn = 1e9, maxx = -1e9;

int main() {
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) {
		scanf("%d", &a[i]);
		s[i] = s[i - 1] + a[i];
		if (minn > s[i]) {
			minn = s[i];
		}
		if (maxx < s[i]) {
			maxx = s[i];
		}
	}
	printf("%d", maxx - minn);
	return 0;
}

不到为啥

TAT