Answer Happy

Data structures and Algorithms
6. (5 marks) In the baseball elimination problem, we can show that if wi​+ri​≤wk​+rk​ and team k is eliminated, then team i is also eliminated (where wi​ denotes the wins of team i, and ri​ denotes the number of games that team i has left to play). Use this fact to show that in a division containing n teams, we can determine all the eliminated teams by solving O(logn) maxflow problems.