There are N players which are playing a tournament. We need to find the maximum number of games the winner can play. In this tournament, two players are allowed to play against each other only if the difference between games played by them is not more than one.
Input : N = 3 Output : 2 Maximum games winner can play = 2 Assume that player are P1, P2 and P3 First, two players will play let (P1, P2) Now winner will play against P3, making total games played by winner = 2 Input : N = 4 Output : 2 Maximum games winner can play = 2 Assume that player are P1, P2, P3 and P4 First two pairs will play lets (P1, P2) and (P3, P4). Now winner of these two games will play against each other, making total games played by winner = 2
We can solve this problem by first computing minimum number of players required such that the winner will play x games. Once this is computed actual problem is just inverse of this. Now assume that dp[i] denotes minimum number of players required so that winner plays i games. We can write a recursive relation among dp values as,
dp[i + 1] = dp[i] + dp[i – 1] because if runner up has played (i – 1) games and winner has played i games and all players against which they have played the match are disjoint, total games played by winner will be addition of those two sets of players.
Above recursive relation can be written as dp[i] = dp[i – 1] + dp[i – 2]
Which is same as the Fibonacci series relation, so our final answer will be the index of the maximal Fibonacci number which is less than or equal to given number of players in the input.
This article is contributed by Utkarsh Trivedi. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
- Coin game winner where every player has three choices
- Maximum sum bitonic subarray
- Size of The Subarray With Maximum Sum
- Maximum size subset with given sum
- Maximum subarray sum in O(n) using prefix sum
- Maximum value with the choice of either dividing or considering as it is
- Maximum sum alternating subsequence
- Maximum subsequence sum such that no three are consecutive
- Path with maximum average value
- Maximum sum Bi-tonic Sub-sequence
- Longest subarray having maximum sum
- Maximum Product Cutting | DP-36
- Maximum sum rectangle in a 2D matrix | DP-27
- Maximum length of segments of 0's and 1's
- Maximum Sum Increasing Subsequence | DP-14