[Stone Prob] Anyone clearify doubt in problem statement

whether the MAX calculation and (MAX-Ai) operation has to be perform for every of K turn???

Please dont ask such questions , please, its very very clear in the problem statement.

1 Like

try to solve the problem yourself ,just try to understand the problem statement ur self o body is going to tell you if once you get the logic it can be implemented easily

Don’t ask questions related to ongoing contest.

I know that my friend but I didn’t get that clearly from prob statement

During “a turn” the maximal value over all Ai is chosen, let’s call it MAX…

Help Roman to find out how will the array look like after “K turns”.

Hope you understood now.


I am having the same issue as this guy… someone please give another test case. I am new to competitive programming, please someone help.