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 N = 3e5+9;
  9. const int INF = 2e9+1;
  10. const int LINF = 2000000000000000001;
  11.  
  12.  
  13.  
  14.  
  15. //_ ***************************** START Below *******************************
  16.  
  17.  
  18.  
  19.  
  20. vector<int> E;
  21. vector<int> M;
  22. vector<int> H;
  23.  
  24. int consistency(int n){
  25.  
  26. vector<int> dpE(n);
  27. vector<int> dpM(n);
  28. vector<int> dpH(n);
  29.  
  30. dpE[0] = E[0];
  31. dpM[0] = M[0];
  32. dpH[0] = H[0];
  33.  
  34. dpE[1] = E[1] + max({dpE[0], dpM[0], dpH[0]});
  35. dpM[1] = M[1] + max({dpE[0], dpM[0], dpH[0]});
  36. dpH[1] = H[1] + max({dpE[0], dpM[0], dpH[0]});
  37.  
  38.  
  39. for(int i=2; i<n; i++){
  40. dpE[i] = E[i] + max( {dpE[i-1] , dpM[i-1] , dpH[i-1] });
  41. dpM[i] = M[i] + E[i-1] + dpM[i-2];
  42.  
  43. dpH[i] = H[i] + E[i-1] + dpE[i-2];
  44. if(i-3>=0){
  45. dpH[i] = max(dpH[i] , H[i] + M[i-1] + E[i-2] + dpM[i-3] );
  46. dpH[i] = max(dpH[i] , H[i] + H[i-1] + E[i-2] + dpE[i-3] );
  47. }
  48.  
  49. }
  50.  
  51. return max({dpE[n-1], dpM[n-1], dpH[n-1]});
  52.  
  53.  
  54. }
  55.  
  56.  
  57.  
  58.  
  59.  
  60.  
  61.  
  62.  
  63.  
  64.  
  65.  
  66.  
  67.  
  68.  
  69.  
  70. int practice(int n){
  71.  
  72.  
  73. return 0;
  74. }
  75.  
  76.  
  77.  
  78.  
  79.  
  80. void solve() {
  81.  
  82. int n;
  83. cin>> n;
  84.  
  85. E.resize(n);
  86. M.resize(n);
  87. H.resize(n);
  88. for(int i=0; i<n; i++) cin >> E[i];
  89. for(int i=0; i<n; i++) cin >> M[i];
  90. for(int i=0; i<n; i++) cin >> H[i];
  91.  
  92. cout << consistency(n) << endl;
  93.  
  94.  
  95. }
  96.  
  97.  
  98.  
  99.  
  100.  
  101. int32_t main() {
  102. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  103.  
  104. int t = 1;
  105. // cin >> t;
  106. while (t--) {
  107. solve();
  108. }
  109.  
  110. return 0;
  111. }
Success #stdin #stdout 0s 5300KB
stdin
5
10 20 30 40 50
20 30 40 50 60
30 40 50 60 100
stdout
240