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$ ...
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
greedy-algorithms × 440algorithms × 258
dynamic-programming × 70
optimization × 64
graphs × 61
correctness-proof × 48
algorithm-analysis × 37
approximation × 31
scheduling × 25
intervals × 20
proof-techniques × 17
knapsack-problems × 17
time-complexity × 15
sorting × 12
combinatorics × 11
arrays × 9
minimum-spanning-tree × 9
trees × 8
set-cover × 8
matroids × 8
data-structures × 7
np-complete × 7
np-hard × 6
search-algorithms × 6
shortest-path × 6