fork download
copy 
  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. 		if(i == 2) {
  44. 			// H[2] strictly requires E[0], but Day 1 can be any permutation
  45. 			dpH[2] = H[2] + max({E[1], M[1], H[1]}) + E[0];
  46. 		}
  47. 		else{
  48. 			dpH[i] = H[i] + E[i-1] + dpE[i-2];
  49. 			if(i-3>=0){
  50. 				// dpH[i] = max(dpH[i] , H[i] + M[i-1] + E[i-2] + dpM[i-3] );
  51. 				dpH[i] = max(dpH[i] , H[i] + dpM[i-1] );
  52. 				dpH[i] = max(dpH[i] , H[i] + H[i-1] + E[i-2] + dpE[i-3] );
  53. 			}
  54. 		}
  55.  
  56. 	}
  57.  
  58. 	return max({dpE[n-1], dpM[n-1], dpH[n-1]});
  59.  
  60.  
  61. }
  62.  
  63.  
  64.  
  65.  
  66.  
  67.  
  68.  
  69.  
  70.  
  71.  
  72.  
  73.  
  74.  
  75.  
  76.  
  77. int practice(int n){
  78.  
  79.  
  80.     return 0;
  81. }
  82.  
  83.  
  84.  
  85.  
  86.  
  87. void solve() {
  88.  
  89.     int n;
  90.     cin>> n;
  91.  
  92.     E.resize(n);
  93.     M.resize(n);
  94.     H.resize(n);
  95.     for(int i=0; i<n; i++) cin >> E[i];
  96.     for(int i=0; i<n; i++) cin >> M[i];
  97.     for(int i=0; i<n; i++) cin >> H[i];
  98.  
  99.     cout << consistency(n) << endl;
  100.  
  101.  
  102. }
  103.  
  104.  
  105.  
  106.  
  107.  
  108. int32_t main() {
  109.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  110.  
  111.     int t = 1;
  112.     // cin >> t;
  113.     while (t--) {
  114.         solve();
  115.     }
  116.  
  117.     return 0;
  118. }
Success #stdin #stdout 0.01s 5288KB
comments (?)
stdin
copy 
5
10 20 30 40 50
20 30 40 50 60
30 40 50 60 100
stdout
copy 
240
https://ideone.com/zBNP8z
language:
C++14 (gcc 8.3)
created:
1 day ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!