题解 | 连续子数组最大和

#include<bits/stdc++.h>
using namespace std;

int main() {
	int n, sum = 0, ans = -0x3f3f3f3f;
	cin >> n;
	for (int i = 1, x; i <= n; i++) {
		cin >> x;
		sum += x;
		ans = max(ans, sum);
		sum = max(sum, 0);
	}
	cout << ans << endl;
	return 0;
}