fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long int
  4. #define double long double
  5. #define print(a) for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14. int x = 1;
  15. a %= mod;
  16. while (b) {
  17. if (b & 1) x = (x * a) % mod;
  18. a = (a * a) % mod;
  19. b >>= 1;
  20. }
  21. return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27.  
  28.  
  29.  
  30. vector<vector<int>> a;
  31.  
  32. int consistency(int n){
  33.  
  34.  
  35. vector<vector<int>> dp(n, vector<int>(3, 0));
  36. dp[0] = a[0];
  37.  
  38. for(int i=1; i<n; i++){
  39. dp[i][0] = max(dp[i-1][1], dp[i-1][2]) + a[i][0];
  40. dp[i][1] = max(dp[i-1][0], dp[i-1][2]) + a[i][1];
  41. dp[i][2] = max(dp[i-1][0], dp[i-1][1]) + a[i][2];
  42. }
  43.  
  44. return max(dp[n-1][0], max(dp[n-1][1], dp[n-1][2]));
  45.  
  46. }
  47.  
  48.  
  49.  
  50.  
  51.  
  52.  
  53.  
  54.  
  55.  
  56.  
  57.  
  58.  
  59.  
  60.  
  61.  
  62. int practice(int n){
  63.  
  64.  
  65. return 0;
  66. }
  67.  
  68.  
  69.  
  70.  
  71.  
  72. void solve() {
  73.  
  74. int n;
  75. cin>> n;
  76.  
  77. a.resize(n);
  78. for(int i=0; i<n; i++){
  79. int x, y, z;
  80. cin >> x >> y >> z;
  81. a[i] = {x, y, z};
  82. }
  83.  
  84. cout << consistency(n) << endl;
  85.  
  86.  
  87. }
  88.  
  89.  
  90.  
  91.  
  92.  
  93. int32_t main() {
  94. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  95.  
  96. int t = 1;
  97. // cin >> t;
  98. while (t--) {
  99. solve();
  100. }
  101.  
  102. return 0;
  103. }
Success #stdin #stdout 0s 5324KB
stdin
7
6 7 8
8 8 3
2 5 2
7 8 6
4 6 8
2 3 4
7 5 1
stdout
46