Submission

[PPP][PPPPPP][PP]

Score: 100

User: detectives_conan

Problemset: ช่างไฟ

Language: cpp

Time: 0.114 second

Submitted On: 2025-01-03 14:11:48

/*
Author : detective conan
problem : Electrician
*/
#include<bits/stdc++.h>
#define int long long

using namespace std;

const bool HAVE_TESTCASE = false;

void solve(){
    int n; cin >> n;
    vector<int> arr(n + 1, 0);
    for(int i = 1; i <= n; ++i) cin >> arr[i];
    int dp[n + 1][2] = {{0}};
    dp[1][0] = arr[1], dp[1][1] = abs(arr[1]);
    for(int i = 2; i <= n; ++i){
        dp[i][0] = dp[i - 1][0] + arr[i];
        dp[i][1] = max(abs(dp[i - 1][1] + arr[i]), abs(dp[i - 1][0] + arr[i]));
    }
    cout << max(dp[n][1], dp[n][0]) << '\n';
}

int32_t main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    int t = 1;
    if(HAVE_TESTCASE) cin >> t;
    while(t--) solve();
}