提出 #72032886

---

ソースコード 拡げる

#include <bits/stdc++.h>

#include <atcoder/all>

using namespace std;
using namespace atcoder;

#define int long long
#define ALL(x) (x).begin(), (x).end()
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))

typedef pair<int, int> PI;
typedef pair<int, pair<int, int>> PII;
static const int INF = 1010000000000000017LL;
static const double eps = 1e-12;
static const double pi = 3.14159265358979323846;
static const int dx[4] = {1, -1, 0, 0};
static const int dy[4] = {0, 0, 1, -1};
static const int ddx[8] = {1, -1, 0, 0, 1, 1, -1, -1};
static const int ddy[8] = {0, 0, 1, -1, 1, -1, 1, -1};

template <class T>
inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T>
inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

int N;

signed main() {
    cin >> N;
    vector<int> A(N), B(N), C(N);
    vector<int> SA(N + 1, 0), SB(N + 1, 0), SC(N + 1, 0), S(N + 1, 0);
    for (int i = 0; i < N; ++i) cin >> A[i];
    for (int i = 0; i < N; ++i) cin >> B[i];
    for (int i = 0; i < N; ++i) cin >> C[i];
    for (int i = 0; i < N; ++i) {
        SA[i + 1] = SA[i] + A[i];
        SB[i + 1] = SB[i] + B[i];
        SC[i + 1] = SC[i] + C[i];
        S[i + 1] = SB[i + 1] - SC[i + 1];
    }
    auto op = [](int a, int b) { return max(a, b); };
    auto e = []() { return -INF; };
    segtree<int, op, e> seg(S);

    int ans = -INF;
    for (int i = 1; i < N; ++i) {
        int x = SA[i] - SB[i] + SC[N];
        int y = seg.prod(i + 1, N);
        chmax(ans, x + y);
    }
    cout << ans << endl;
}

提出情報

ジャッジ結果