3
votes
Accepted
Prove maximum score is achieved by being greedy
If $(t_0, t_1, …, t_{n-1})$ is the sequence of tokens played by your greedy solution, you can show by induction that for any $k\in \{0, …, n\}$, the sequence $(t_0, …, t_{k-1})$ is the sequence of $k$ ...
- 15.6k
Only top scored, non community-wiki answers of a minimum length are eligible