func_code_string: #include <bits/stdc++.h>   using namespace std;   template <class T>   using VV = vector<vector<T>>;   template <class T>   inline T SMIN(T& a, const T b) {     return a = (a > b) ? b : a;   }   template <class T>   inline T SMAX(T& a, const T b) {     return a = (a < b) ? b : a;   }   template <class Iter>   void __kumaerrc(Iter begin, Iter end) {     for (; begin != end; ++begin) {       cerr << *begin <<  , ;     }     cerr << endl;   }   void __kumaerr(istream_iterator<string> it) {     (void)it;     cerr << endl;   }   template <typename T, typename... Args>   void __kumaerr(istream_iterator<string> it, T a, Args... args) {     cerr << *it <<  =  << a <<  ,  , __kumaerr(++it, args...);   }   template <typename S, typename T>   std::ostream& operator<<(std::ostream& _os, const std::pair<S, T>& _p) {     return _os <<  {  << _p.first <<  ,  << _p.second <<  } ;   }   const int MAX_N = 1e6 + 1;   long long A[MAX_N];   int N;   long long f(vector<long long> bs) {     int N = int((bs).size());     long long cur = 0, mn = 0, res = 0;     for (int i = 0; i < (N); ++i) {       cur += bs[i];       SMAX(res, cur - mn);       SMIN(mn, cur);     }     return res;   }   void solve() {     long long base = 0;     for (int i = 0; i < (N); ++i)       if (i % 2 == 0) base += A[i];     vector<long long> bs;     for (int i = 0; i < (N / 2); ++i) bs.push_back(A[2 * i + 1] - A[2 * i]);     long long res = base;     SMAX(res, base + f(bs));     bs.clear();     for (int i = (1); i <= ((N - 1) / 2); ++i)       bs.push_back(A[2 * i - 1] - A[2 * i]);     SMAX(res, base + f(bs));     cout << res << endl;   }   const long long Inf = 1e18;   long long dp[MAX_N][4];   void solve_dp() {     for (int i = 0; i <= (N); ++i)       for (int j = 0; j < (4); ++j) dp[i][j] = -Inf;     dp[0][0] = dp[0][2] = dp[0][3] = 0;     for (int i = 0; i < (N); ++i)       for (int j = 0; j < (4); ++j) {         if (j == 0) {           if (i % 2 == 0) {             SMAX(dp[i + 1][j], dp[i][j] + A[i]);             SMAX(dp[i + 1][1], dp[i][j] + A[i]);           } else {             SMAX(dp[i + 1][j], dp[i][j]);             SMAX(dp[i + 1][2], dp[i][j]);           }         }         if (j == 1 || j == 2) {           if (i % 2 == 0) {             SMAX(dp[i + 1][j], dp[i][j]);             if (j == 1) SMAX(dp[i + 1][3], dp[i][j]);           } else {             SMAX(dp[i + 1][j], dp[i][j] + A[i]);             if (j == 2) SMAX(dp[i + 1][3], dp[i][j] + A[i]);           }         }         if (j == 3) {           if (i % 2 == 0) {             SMAX(dp[i + 1][j], dp[i][j] + A[i]);           } else {             SMAX(dp[i + 1][j], dp[i][j]);           }         }       }     long long res = 0;     if (N % 2 == 0) dp[N][1] = -Inf;     for (int j = 0; j < (4); ++j) {       SMAX(res, dp[N][j]);     }     cout << res << endl;   }   int main() {     ios_base::sync_with_stdio(false);     cin.tie(0);     cout << setprecision(12) << fixed;     int t;     cin >> t;     while (t--) {       cin >> N;       for (int i = 0; i < (N); ++i) cin >> A[i];       solve();     }     return 0;   }   