题解 | 子数组绝对值的最大值

#include <iostream>
#include <string>


using namespace std;

const int N = 2e5 + 10;
int a[N];
int s[N];

int main() {
    int n;
    cin>>n;
    for(int i = 1;i <= n;i++){
        cin>>a[i];
    }
    for(int i = 1;i <= n;i++){
        s[i] = s[i - 1] + a[i];
    }
    int mx =  -2e8 + 10;
    int mn = 2e8 + 10;
    for(int i = 0;i <= n;i++){
        mx = max(mx,s[i]);
        mn = min(mn,s[i]);
    }
    int res = mx - mn;
    cout<<res;

}
// 64 位输出请用 printf("%lld")