Submission #2121815

---

Source Code Expand

#include <iostream>
#include <vector>
#include <cstdlib>
#include <climits>
using namespace std;

int main(){
    int n; cin >> n;
    vector<vector<int>> v(2, vector<int>(n));
    for(int i = 0; i < 2; ++i){
        for(int j = 0; j < n; ++j){
            cin >> v[i][j];
        }
    }

    vector<vector<int>> dp(2, vector<int>(n, -1));
    dp[0][0] = v[0][0];

    for(int i = 0; i < 2; ++i){
        for(int j = 0; j < n; ++j){
            if(dp[i][j] == -1) continue;
            // 下方向への遷移
            if(i+1 < 2) dp[i+1][j] = max(dp[i][j] + v[i+1][j], dp[i+1][j]);
            // 右方向への遷移
            if(j+1 < n) dp[i][j+1] = max(dp[i][j] + v[i][j+1], dp[i][j+1]);
        }
    }

    cout << dp[1][n-1] << endl;
    return EXIT_SUCCESS;
}

Submission Info

Judge Result