2096 - 내려가기

#include <iostream>
#include <algorithm>
 
using namespace std;
 
int i, j;
int max_arr[3];
int min_arr[3];
int pre_arr[3];
int a[100000][3];
int N;
 
int main() {    
 
    cin >> N;    
 
    for (i = 0; i < N; i++) {
        for (j = 0; j < 3; j++) {
            cin >> a[i][j];
        }
    }
                            
    for (i = 0; i < 3; i++) {
        max_arr[i] = a[0][i];
        min_arr[i] = a[0][i];
    }
    
    for (i = 1; i < N; i++) {
        pre_arr[0] = a[i][0] + max(max_arr[0], max_arr[1]);
        pre_arr[1] = a[i][1] + max(max(max_arr[0], max_arr[1]), max_arr[2]);        
        pre_arr[2] = a[i][2] + max(max_arr[1], max_arr[2]);
        max_arr[0] = pre_arr[0];
        max_arr[1] = pre_arr[1];
        max_arr[2] = pre_arr[2];
 
        pre_arr[0] = a[i][0] + min(min_arr[0], min_arr[1]);
        pre_arr[1] = a[i][1] + min(min(min_arr[0], min_arr[1]), min_arr[2]);
        pre_arr[2] = a[i][2] + min(min_arr[1], min_arr[2]);
        min_arr[0] = pre_arr[0];
        min_arr[1] = pre_arr[1];
        min_arr[2] = pre_arr[2];
    }
 
    cout << max(max(max_arr[0], max_arr[1]), max_arr[2]) << " ";
    cout << min(min(min_arr[0], min_arr[1]), min_arr[2]);
    return 0;
}