func_code_string: #include <bits/stdc++.h>   using namespace std;   using namespace std::chrono;   template <typename A>   ostream &operator<<(ostream &cout, vector<A> const &v);   template <typename A, typename B>   ostream &operator<<(ostream &cout, pair<A, B> const &p) {     return cout <<  (  << p.first <<  ,   << p.second <<  ) ;   }   template <typename A>   ostream &operator<<(ostream &cout, vector<A> const &v) {     cout <<  [ ;     for (int i = 0; i < v.size(); i++) {       if (i) cout <<  ,  ;       cout << v[i];     }     return cout <<  ] ;   }   template <typename A, typename B>   istream &operator>>(istream &cin, pair<A, B> &p) {     cin >> p.first;     return cin >> p.second;   }   mt19937 rng(steady_clock::now().time_since_epoch().count());   void usaco(string filename) {     freopen((filename +  .in ).c_str(),  r , stdin);     freopen((filename +  .out ).c_str(),  w , stdout);   }   const long double pi = 3.14159265358979323846;   long long n, m, k, q, l, r, x, y, z;   long long a[1000005];   long long b[1000005];   long long c[1000005];   string second, t;   long long ans = 0;   long long solve2() {     long long r = 0, best = 0;     for (long long i = 0; i < (n - 1); ++i) {       r += b[i];       best = max(best, r);       if (r < 0) r = 0;     }     return best;   }   void solve(int tc) {     cin >> n;     for (int ele = 0; ele < n; ele++) cin >> a[ele];     ;     for (long long i = 0; i < (n - 1); ++i) {       b[i] = abs(a[i] - a[i + 1]);       if (i % 2) b[i] = -b[i];     }     ans = 0;     ans = max(ans, solve2());     for (long long i = 0; i < (n - 1); ++i) b[i] = -b[i];     ans = max(ans, solve2());     cout << ans <<   n ;   }   int main() {     { ios_base::sync_with_stdio(false); }     {       cin.tie(NULL);       cout.tie(NULL);     }     int tc = 1;     for (int t = 0; t < tc; t++) solve(t);   }   