연속합

#include <stdio.h>

int p[100001];
int a[100001];

int get_max(int a, int b) {
	return a > b ? a : b;
}

int main() {
	freopen("input.txt", "rt", stdin);
	int n;
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) {
		scanf("%d", &p[i]);
	}
	int m = -2147000000;
	for (int i = 1; i <= n; i++) {
		a[i] = get_max(p[i], a[i - 1] + p[i]);
		m = get_max(a[i], m);
	}
	printf("%d", m);

	return 0;
}