Advertisement
unknown_0711

Untitled

Apr 23rd, 2023
862
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.64 KB | None | 0 0
  1. #include "bits/stdc++.h"
  2. using namespace std;
  3. int dp[100001][3], a[100001][3];
  4. int n;
  5. // vector< vector<int> > dp(100001, vector<int> (3,-1);
  6. // vector< vector<int> > dp(100001, vector<int> (3);
  7. // same with a
  8.  
  9. int main() {
  10.     cin >> n;
  11.     for (int i = 0; i < n; i++)
  12.         for (int j = 0; j < 3; j++) {
  13.             cin >> a[i][j];
  14.  
  15.         }
  16.     for (int j = 0; j < 3; j++)dp[n - 1][j] = a[n - 1][j];
  17.  
  18.  
  19.     for (int i = n - 2; i >= 0; i--) {
  20.         for (int j = 0; j < 3; j++) {
  21.             dp[i][j] = a[i][j] + max(dp[i + 1][(j + 1) % 3], dp[i + 1][(j + 2) % 3]);
  22.         }
  23.     }
  24.     int ans = 0;
  25.     for (int i = 0; i < 3; i++)ans = max(ans, dp[0][i]);
  26.     cout << ans << endl;
  27.  
  28. }
  29.  
  30.  
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement