python/TangDou/Topic/PrefixAndSuffix/P1115_DP.cpp

#include <bits/stdc++.h>
using namespace std;
const int N = 200100;
int ans = INT_MIN;
int n;
int a[N], dp[N]; // dp[i]定义：前i个范围内，区间和的最大值

int main() {
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        dp[i] = max(dp[i - 1] + a[i], a[i]);
        ans = max(ans, dp[i]);
    }
    printf("%d\n", ans);
    return 0;
}