18708 最大子段和

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
#include<string>
#include<iostream>
using namespace std;
#define max(a,b) a>b?a:b


int main() {
	int  n;
	scanf("%d", &n);
	int num[n] = {0}, sum[n] = { 0 };
	int m = sum[1];
	for (int i = 1; i <= n; i++) {
		scanf("%d", &num[i]);
		sum[i]=sum[i - 1] + num[i];
		m = max(sum[i], m);
		if (sum[i] < 0)sum[i] = 0;
	}


 printf("%d",m);


	return 0;
}