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 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<int> a;
  31. vector<int> b;
  32.  
  33. int consistency1(int n){
  34. 	if(n==0) return 0;
  35. 	if(n==1) return max(a[0], b[0]);
  36. 	if(n==2) return max({ a[0]+a[1], a[0]+b[1] , b[0]+b[1] , b[0]+a[1]  });
  37.  
  38. 	vector<vector<int>> dpA(n, vector<int>(2, 0));
  39. 	vector<vector<int>> dpB(n, vector<int>(2, 0));
  40.  
  41.  
  42. 	dpA[0][0] = a[0];
  43. 	dpA[0][1] = 0;
  44. 	dpA[1][0] = b[0] + a[1];
  45. 	dpA[1][1] = a[0] + a[1];
  46.  
  47. 	dpB[0][0] = b[0];
  48. 	dpB[0][1] = 0;
  49. 	dpB[1][0] = a[0] + b[1];
  50. 	dpB[1][1] = b[0] + b[1];
  51.  
  52. 	for(int i=2; i<n; i++){
  53. 		dpA[i][0] = a[i] + max( dpB[i-1][0] , dpB[i-1][1] );
  54. 		dpB[i][0] = b[i] + max( dpA[i-1][0] , dpA[i-1][1] );
  55.  
  56. 		dpA[i][1] = max( a[i] + a[i-1] + max(dpB[i-2][0], dpB[i-2][1]) , a[i] + dpA[i-1][0] );
  57. 		dpB[i][1] = max( b[i] + b[i-1] + max(dpA[i-2][0], dpA[i-2][1]) , b[i] + dpB[i-1][0] );
  58.  
  59. 	}
  60.  
  61. 	return max({dpA[n-1][0], dpA[n-1][1], dpB[n-1][0], dpB[n-1][1] });
  62.  
  63. }
  64.  
  65.  
  66.  
  67.  
  68.  
  69. int consistency2(int n){
  70. 	if(n==0) return 0;
  71. 	if(n==1) return max(a[0], b[0]);
  72. 	if(n==2) return max({ a[0]+a[1], a[0]+b[1] , b[0]+b[1] , b[0]+a[1]  });
  73.  
  74. 	vector<vector<vector<int>>> dp(n, vector<vector<int>>(2, vector<int>(2, 0)));
  75.  
  76. 	dp[0][0][0] = a[0];
  77.     dp[0][0][1] = a[0];
  78.     dp[0][1][0] = b[0];
  79.     dp[0][1][1] = b[0];
  80.  
  81.     dp[1][0][0] = a[0] + a[1];
  82.     dp[1][0][1] = b[0] + a[1];
  83.     dp[1][1][0] = a[0] + b[1];
  84.     dp[1][1][1] = b[0] + b[1];
  85.  
  86. 	for(int i=2; i<n; i++){
  87. 		dp[i][0][0] =  a[i] + a[i-1] + max( dp[i-2][1][0], dp[i-2][1][1] );
  88.  
  89. 		dp[i][0][1] =  a[i] + b[i-1] + max( {dp[i-2][1][0] , dp[i-2][0][1] , dp[i-2][0][0]  } );
  90.  
  91. 		dp[i][1][1] = b[i] + b[i-1] + max( dp[i-2][0][1], dp[i-2][0][0] );
  92.  
  93. 		dp[i][1][0] = b[i] + a[i-1] + max( {dp[i-2][0][1] , dp[i-2][1][0] , dp[i-2][1][1]  } );
  94. 	}
  95.  
  96. 	return max( {dp[n-1][0][0], dp[n-1][0][1], dp[n-1][1][0], dp[n-1][1][1] });
  97. }
  98.  
  99.  
  100.  
  101.  
  102.  
  103.  
  104.  
  105.  
  106.  
  107. int practice(int n){
  108.  
  109.  
  110.     return 0;
  111. }
  112.  
  113.  
  114.  
  115.  
  116.  
  117. void solve() {
  118.  
  119.     int n;
  120.     cin>> n;
  121.  
  122.     a.resize(n);
  123.     b.resize(n);
  124.     for(int i=0; i<n; i++) cin >> a[i];
  125.     for(int i=0; i<n; i++) cin >> b[i];
  126.  
  127.     cout << consistency1(n) << " " << consistency2(n) << endl;
  128.     // cout << consistency1(n)  << endl;
  129.  
  130.  
  131. }
  132.  
  133.  
  134.  
  135.  
  136.  
  137. int32_t main() {
  138.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  139.  
  140.     int t = 1;
  141.     // cin >> t;
  142.     while (t--) {
  143.         solve();
  144.     }
  145.  
  146.     return 0;
  147. }
Success #stdin #stdout 0.01s 5276KB
comments (?)
stdin
copy 
3
5 3 4
10 10 10
stdout
copy 
25 25
https://ideone.com/C1YsFd
language:
C++14 (gcc 8.3)
created:
18 hours 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!