#include<bits/stdc++.h>
using namespace std;
#define int long long
const int INF = 1e18;
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<int> v(n);
for(int i = 0; i < n; i++) {
cin >> v[i];
}
int total = 0;
// given a starting position i, what is the max value
// the starting player can guarantee
vector<int> dp(n+1, 0);
for(int i = n-1; i >= 0; i--) {
total += v[i];
// dp[i+1] -> player chooses to take the slice and
// other player becomes the starting player in rest
// of the game
//
// total - dp[i+1] -> player chooses to give away the slice
// and keep the decoder token, now this player is the starting
// player in the rest of the game
dp[i] = max(dp[i+1], total - dp[i+1]);
}
cout << total - dp[0] << ' ' << dp[0] << '\n';
return 0;
}
1920. Build Array from Permutation | 494. Target Sum |
797. All Paths From Source to Target | 1547B - Alphabetical Strings |
1550A - Find The Array | 118B - Present from Lena |
27A - Next Test | 785. Is Graph Bipartite |
90. Subsets II | 1560A - Dislike of Threes |
36. Valid Sudoku | 557. Reverse Words in a String III |
566. Reshape the Matrix | 167. Two Sum II - Input array is sorted |
387. First Unique Character in a String | 383. Ransom Note |
242. Valid Anagram | 141. Linked List Cycle |
21. Merge Two Sorted Lists | 203. Remove Linked List Elements |
733. Flood Fill | 206. Reverse Linked List |
83. Remove Duplicates from Sorted List | 116. Populating Next Right Pointers in Each Node |
145. Binary Tree Postorder Traversal | 94. Binary Tree Inorder Traversal |
101. Symmetric Tree | 77. Combinations |
46. Permutations | 226. Invert Binary Tree |