I am preparing for the exam and I am stuck with this problem:
We have n teams that play each other twice. Each game ends without a draw. The team with the highest winnings is declared the winner (there may be more than one). To develop an algorithm that gives a certain set of initial results of games, checks whether a certain team has a chance to become a winner in this tournament.
I do not know how to approach. The problem has been put into the category of "Streams and mappings", but I do not see how this can be a problem of maximum flow.
source
share