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