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<int> a;
  31.  
  32. int consistency(int n){
  33.  
  34. vector<int> dpA(n);
  35. vector<int> dpB(n);
  36. vector<int> dpX(n);
  37.  
  38. dpA[0] = max( 0LL, a[0]);
  39. dpB[0] = max( 0LL, a[0]);
  40. dpX[0] = 0;
  41.  
  42. for(int i=1; i<n; i++){
  43. dpA[i] = a[i] + max( dpB[i-1] , dpX[i-1] );
  44. dpB[i] = a[i] + max( dpA[i-1] , dpX[i-1] );
  45. dpX[i] = max( { dpA[i-1] , dpB[i-1] , dpX[i-1] } );
  46. }
  47.  
  48. return max( { dpA[n-1], dpB[n-1] , dpX[n-1] } );
  49. }
  50.  
  51.  
  52.  
  53.  
  54.  
  55.  
  56.  
  57.  
  58.  
  59.  
  60.  
  61.  
  62.  
  63.  
  64.  
  65. int practice(int n){
  66.  
  67.  
  68. return 0;
  69. }
  70.  
  71.  
  72.  
  73.  
  74.  
  75. void solve() {
  76.  
  77. int n;
  78. cin>> n;
  79.  
  80. a.resize(n);
  81. for(int i=0; i<n; i++) cin >> a[i];
  82.  
  83. cout << consistency(n) << endl;
  84.  
  85.  
  86. }
  87.  
  88.  
  89.  
  90.  
  91.  
  92. int32_t main() {
  93. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  94.  
  95. int t = 1;
  96. // cin >> t;
  97. while (t--) {
  98. solve();
  99. }
  100.  
  101. return 0;
  102. }
Success #stdin #stdout 0s 5320KB
stdin
7
5 8 3 1 2 -4 -5
stdout
19