题解 | #连续子数组最大和#

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

int n, num, f[2], ans = -0x3f3f3f3f;

int main(){
    cin >> n;
    for (int i = 0; i < n; i++){
        cin >> num;
        if (!i) f[i] = num;
        else f[i & 1] = max(f[!(i & 1)] + num, num); // 决策：选还是不选
        ans = max(ans, f[i & 1]);
    }
    cout << ans << endl;
    return 0;
}