题解 | 最大子段和

#include<bits/stdc++.h>
using namespace std;
int main(){
    int n;
    cin >> n;
    vector<int> a;
    a.resize(n);
    for(int i=0; i<n; i++){
        cin >> a[i];
    }
    vector<long long> dp(n,-100001);
    dp[0] = a[0];
    for(int i=1; i<n; i++){
        dp[i] = max( (long long)a[i], dp[i-1]+a[i]);
    }
    auto maxIt = max_element(dp.begin(), dp.end());
    cout << *maxIt;
}