提出 #72012746

---

ソースコード 拡げる

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)

void solve(){
    
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n; cin >> n;
    vll a(n), b(n), c(n);
    rep(i, n)cin >> a[i];
    rep(i, n)cin >> b[i];
    rep(i, n)cin >> c[i];
    vvll dp(n, vll(2, 0));
    dp[n-1][1] = c[n-1];
    drep(i, n-1)dp[i][1] = dp[i+1][1] + c[i];
    dp[n-2][0] = b[n-2]+c[n-1];
    drep(i, n-2)dp[i][0] = max(dp[i+1][0], dp[i+1][1]) + b[i];
    ll s = a[0], ans = a[0] + dp[1][0];
    rep2(i, 1, n-2){
        s += a[i];
        ans = max(ans, s + dp[i+1][0]);
    }cout << ans << endl;
    return 0;
}

提出情報

ジャッジ結果