func_code_string: #include <bits/stdc++.h>   using namespace std;   const long long MOD = 1e9 + 7;   const long long inf = 10000000;   inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }   inline bool isLeapYear(long long year) {     return (year % 400 == 0) || (year % 4 == 0 && year % 100 != 0);   }   inline void normal(long long &a) {     a %= MOD;     (a < 0) && (a += MOD);   }   inline long long modMul(long long a, long long b) {     a %= MOD, b %= MOD;     normal(a), normal(b);     return (a * b) % MOD;   }   inline long long modAdd(long long a, long long b) {     a %= MOD, b %= MOD;     normal(a), normal(b);     return (a + b) % MOD;   }   inline long long modSub(long long a, long long b) {     a %= MOD, b %= MOD;     normal(a), normal(b);     a -= b;     normal(a);     return a;   }   inline long long modPow(long long b, long long p) {     long long r = 1;     while (p) {       if (p & 1) r = modMul(r, b);       b = modMul(b, b);       p >>= 1;     }     return r;   }   inline long long modInverse(long long a) { return modPow(a, MOD - 2); }   inline long long modDiv(long long a, long long b) {     return modMul(a, modInverse(b));   }   inline bool checkBit(long long n, int i) { return n & (1LL << i); }   inline long long setBit(long long n, int i) {     return n | (1LL << i);     ;   }   inline long long resetBit(long long n, int i) { return n & (~(1LL << i)); }   int dx[] = {0, 0, 1, -1};   int dy[] = {1, -1, 0, 0};   void input(long long n, const long long a[], int co = 0) {     long long i = 1;     for (; i <= n; i++) {       if (co == 0)         scanf( %lld , &a[i]);       else         printf( %lld  , a[i]);     }   }   int n, k;   int dp[55][2], a[55], sm;   int dfs(int ps, int k) {     if (ps == n) return 0;     int &rs = dp[ps][k];     if (rs != -1) return rs;     rs = 0;     if (k == 0)       rs = max(a[ps] + dfs(ps + 1, 1), dfs(ps + 1, 0));     else       rs = min(a[ps] + dfs(ps + 1, 1), dfs(ps + 1, 0));     return rs;   }   bool cmp() {}   void solve() {     memset(dp, -1, sizeof dp);     scanf( %d , &n);     for (int i = 0; i < n; i++) {       scanf( %d , &a[i]);       sm += a[i];     }     int rs = dfs(0, 0);     printf( %d %d n , sm - rs, rs);   }   int main() {     solve();     return 0;   }   