func_code_string: #include <bits/stdc++.h>   using namespace std;   template <class T>   inline bool chmax(T &a, const T &b) {     return b > a ? a = b, true : false;   }   template <class T>   inline bool chmin(T &a, const T &b) {     return b < a ? a = b, true : false;   }   template <class T>   using MaxHeap = priority_queue<T>;   template <class T>   using MinHeap = priority_queue<T, vector<T>, greater<T>>;   template <class T, class F = less<T>>   void sort_uniq(vector<T> &v, F f = F()) {     sort(begin(v), end(v), f);     v.resize(unique(begin(v), end(v)) - begin(v));   }   int main() {     ios::sync_with_stdio(0);     cin.tie(0);     int tt;     cin >> tt;     while (tt--) {       int n;       cin >> n;       vector<int> a(n);       for (int i = 0; i < (int)(n); i++) cin >> a[i];       int last = a[0], alice = a[0], bob = 0;       int i = 1, j = n - 1, turn = 1, moves = 1;       while (i <= j) {         int cnt = 0;         if (turn) {           while (i <= j && cnt <= last) {             cnt += a[j--];           }           bob += cnt;         } else {           while (i <= j && cnt <= last) {             cnt += a[i++];           }           alice += cnt;         }         last = cnt;         moves++;         turn ^= 1;       }       cout << moves <<     << alice <<     << bob <<   n ;     }     return 0;   }   