Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <cstring>
- using namespace std;
- const int maxn = 1e5 + 10;
- const int INF = 2e9;
- int n;
- int mat[maxn][3];
- int dp[maxn][3];
- int rec(int at, int last_activity) {
- if(at >= n) {
- return 0;
- }
- if(dp[at][last_activity] != -1) {
- return dp[at][last_activity];
- }
- int res = -INF;
- for(int i = 0; i < 3; i++) {
- if(i != last_activity) {
- res = max(res, rec(at + 1, i) + mat[at][i]);
- }
- }
- dp[at][last_activity] = res;
- return res;
- }
- int main() {
- memset(dp, -1, sizeof dp);
- cin >> n;
- for(int i = 0; i < n; i++) {
- cin >> mat[i][0] >> mat[i][1] >> mat[i][2];
- }
- int res = 0;
- for(int i = 0; i < 3; i++) {
- res = max(res, rec(1, i) + mat[0][i]);
- }
- cout << res << endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement
