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