1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32

#include <iostream>
#include <algorithm>
using namespace std;
int a[3],c[3];
int main(void) {
	int n,temp;
	cin >> n;
	int b[2][3] = { 0 };
	for (int i = 0; i < n; i++) {
		cin >> a[0] >> a[1] >> a[2];
		c[0] = b[0][0];
		c[1] = b[0][1];
		c[2] = b[0][2];
		temp = max(c[1], c[0]);
		b[0][0] = a[0] + temp;
		b[0][1] = a[1] + max(temp, c[2]);
		b[0][2] = a[2] + max(c[1], c[2]);
		c[0] = b[1][0];
		c[1] = b[1][1];
		c[2] = b[1][2];
		temp = min(c[1], c[0]);
		b[1][0] = a[0] + temp;
		b[1][1] = a[1] + min(temp, c[2]);
		b[1][2] = a[2] + min(c[1], c[2]);
	}
	temp = max(b[0][1], b[0][0]);
	cout << max(temp, b[0][2]) << " ";
	temp = min(b[1][1], b[1][0]);
	cout << min(temp, b[1][2]) << endl;

	return 0;
}