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