Submission #18202154

---

Source Code Expand

#include <bits/stdc++.h>
#define ll long long
#define nl "\n"
#define ii pair<int, int>
#define MOD 10000007
#define inf 1 << 30
using namespace std;

const int M = 1e5 + 7;
int dp[M][3], a[M][3], n;
int tc;



void solve()
{
    cin >> n;

    for(int i = 0; i < n; i++){

        for(int j = 0; j < 3; j++) cin >> a[i][j];
    }

    dp[0][0]  = a[0][0];
    dp[0][1]  = a[0][1];
    dp[0][2]  = a[0][2];

    for(int i = 1; i < n; i++){

        for(int j = 0; j < 3; j++){

            for(int k = 0; k < 3; k++){

                if(k == j) continue;

                dp[i][j] = max(dp[i - 1][k] + a[i][j], dp[i][j]);
            }
        }
    }

    int res = 0;

    for(int i = 0; i < 3; i++) res = max(res, dp[n - 1][i]);

    cout << res << nl;
}


int main()
{
    ios_base::sync_with_stdio(false), cin.tie(0);

    int t = 1;
    //cin >> t;

    while (t--)
    {
        solve();
    }

    return 0;
}

Submission Info

Judge Result