题解 | 连续子数组最大和(ACM版本)

#include <iostream>
using namespace std;

int main() {
    int n;
    cin >> n;
    long long res = -1e18, sum = 0;
    while (n--) {
        long long x;
        cin >> x;
        sum = max(x, sum + x);
        res = max(res, sum);
    }
    cout << res << endl;
    return 0;
}