Maximize Value of Function in a Ball Passing Game
You are given an integer array receiver of length n and an integer k.
You are given an integer array receiver of length n and an integer k. n players are playing a ball-passing game.
You choose the starting player, i. The game proceeds as follows: player i passes the ball to player receiver[i], who then passes it to receiver[receiver[i]], and so on, for k passes in total. The game's score is the sum of the indices of the players who touched the ball, including repetitions, i.e. i + receiver[i] + receiver[receiver[i]] + ... + receiver(k)[i].
Return the maximum possible score.
Notes:
Example 1
Input: receiver = [2,0,1], k = 4
Output: 6
Explanation: Starting with player i = 2 the initial score is 2:
Example 2
Input: receiver = [1,1,1,2,3], k = 3
Output: 10
Explanation: Starting with player i = 4 the initial score is 4:
Constraints
- 1 <= receiver.length == n <= 10^5
- 0 <= receiver[i] <= n - 1
- 1 <= k <= 1010
Hints
Companies
No companies reported yet.
Discussion
Sign in to join the discussion.
Loading discussion...
Test results
No test cases yet.