Submission #10405622

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
int n, k, extra;
int sol[100010][4];

int main() {
    cin >> n >> sol[1][1] >> sol[1][2] >> sol[1][3];

    for (int i = 2; i <= n; i++)
        for (int j = 1; j <= 3; j++) {
            cin >> extra;
            for (int h = 1; h <= 3; h++)
                if (j != h)
                    sol[i][j] = max(sol[i][j], sol[i - 1][h] + extra);
        }

    cout << max(max(sol[n][1], sol[n][2]), sol[n][3]);
    return 0;
}

Submission Info

Judge Result